Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078566
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A078566 Number of (simple, undirected, unlabeled, connected) graphs with n vertices which contain no induced subgraph isomorphic to a C5 (the cycle on 5 vertices.). +0
1
1, 1, 2, 6, 20, 105, 726, 7827, 127611 (list; graph; listen)
OFFSET

1,3

COMMENT

Also, number of (simple, undirected, unlabeled, connected) graphs with n vertices which contain no induced subgraph isomorphic to a P5 (the path on 5 vertices.).

CROSSREFS

Sequence in context: A079457 A079455 A052433 this_sequence A076323 A136795 A074115

Adjacent sequences: A078563 A078564 A078565 this_sequence A078567 A078568 A078569

KEYWORD

more,nonn

AUTHOR

Jim Nastos (nastos(AT)gmail.com), Jan 07 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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research