|
Search: id:A140636
|
|
|
| A140636 |
|
Number of unlabeled complex components with n nodes. |
|
+0
3
|
|
| 0, 0, 0, 2, 13, 93, 809, 11005, 260793, 11715808, 1006698524, 164059824899, 50335907853919, 29003487462805642
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
We can find in "The Birth of the Giant Component", p. 2, see the first link:
"As each of the random graphs evolved, the story went, never once was there more than a single `complex' component; i.e. there never were two or more components present simultaneously that were neither trees nor unicyclic."
So a complex component is a connected graph that is neither a tree nor an unicyclic graph. One complex component has at least 4 nodes. See the example.
|
|
LINKS
|
Svante Janson, Donald E. Knuth, Tomasz Luczak, and Boris Pittel, The Birth of the Giant Component.
N. J. A. Sloane, Illustration of initial terms of A001349.
|
|
FORMULA
|
For n < 3, a(n) = A001349(n) - A000055(n); for n >= 3, a(n) = A001349(n) - A000055(n) - A001429(n).
|
|
EXAMPLE
|
a(4)=2. See the two complex components with 4 nodes following the second link.
|
|
CROSSREFS
|
Cf. A001349, A000055, A001429, A005703.
Sequence in context: A033891 A126035 A074617 this_sequence A104255 A118352 A074614
Adjacent sequences: A140633 A140634 A140635 this_sequence A140637 A140638 A140639
|
|
KEYWORD
|
easy,nonn,uned
|
|
AUTHOR
|
Washington Bomfim (webonfim(AT)bol.com.br), May 20 2008
|
|
|
Search completed in 0.002 seconds
|
