|
Search: id:A165647
|
|
|
| A165647 |
|
Number of (simple) graphs on n vertices with each component regular. |
|
+0
3
|
|
| 1, 2, 3, 6, 9, 18, 27, 58, 99, 316, 936, 20225, 410571, 50745729, 2993355213, 1701561156737
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
N. J. A. Sloane, Transforms
|
|
EXAMPLE
|
The a(1)=1 graph is: K_1.
The a(2)=2 graphs are: 2K_1, K_2.
The a(3)=3 graphs are: 3K_1, K_1+K_2, K_3.
The a(4)=6 graphs are: 4K_1, 2K_1+K_2, K_1+K_3, 2K_2, C_4, K_4.
|
|
CROSSREFS
|
The Euler transformation of A005177. Equals A005177 plus A165648.
Sequence in context: A018481 A038754 A133626 this_sequence A066313 A018499 A107847
Adjacent sequences: A165644 A165645 A165646 this_sequence A165648 A165649 A165650
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Sep 23 2009
|
|
|
Search completed in 0.002 seconds
|
