Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079566
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079566 Number of unlabeled, connected graphs on n vertices which have no induced subgraph isomorphic to a C4 (cycle on 4 vertices.) Also known as "square-free" graphs. +0
1
1, 1, 2, 5, 16, 63, 313, 2014, 16724 (list; graph; listen)
OFFSET

1,3

REFERENCES

Z. Blazski, M. Hujter, M. Pluhar and Zs. Tuza, "Graphs with no C4 and 2K2," Discrete Math. 115 (1993) 51-55.

CROSSREFS

Sequence in context: A022494 A136127 A111004 this_sequence A059685 A000112 A127083

Adjacent sequences: A079563 A079564 A079565 this_sequence A079567 A079568 A079569

KEYWORD

more,nonn

AUTHOR

Jim Nastos (nastos(AT)gmail.com), Jan 24 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research