|
Search: id:A058879
|
|
|
| A058879 |
|
Triangle read by rows: T(n,k) = number of connected graphs with one cycle of length m = n-k+1 and n nodes (n >= 3, 3<=k<=n). |
|
+0
1
|
|
| 1, 1, 1, 1, 1, 3, 1, 1, 4, 7, 1, 1, 4, 9, 18, 1, 1, 5, 10, 28, 44, 1, 1, 5, 13, 32, 71, 117, 1, 1, 6, 14, 45, 89, 202, 299
(list; table; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
COMMENT
|
Diagonals give A000226, A000368. Row sums give A001429.
|
|
REFERENCES
|
J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 150, Table 9.
F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 69, (3.4.1).
|
|
EXAMPLE
|
1; 1,1; 1,1,3; 1,1,4,7; 1,1,4,9,18; ...
|
|
CROSSREFS
|
Sequence in context: A131238 A133380 A105687 this_sequence A025255 A016463 A098084
Adjacent sequences: A058876 A058877 A058878 this_sequence A058880 A058881 A058882
|
|
KEYWORD
|
nonn,easy,more,tabl,nice
|
|
AUTHOR
|
njas, Jan 07 2001
|
|
EXTENSIONS
|
More terms from Washington Bomfim (webonfim(AT)bol.com.br), May 12 2008
|
|
|
Search completed in 0.002 seconds
|
