|
Search: id:A005636
|
|
|
| A005636 |
|
Number of n-node connected graphs without points of degree 2.
(Formerly M1548)
|
|
+0
1
|
|
| 1, 1, 0, 2, 5, 32, 234, 3638, 106147, 6039504, 633754161, 120131932774, 41036773627286, 25445404202438466, 28918219616495404542, 60799423389360189091576, 238378454962362129667078385
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
R. W. Robinson, personal communication.
R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976.
|
|
LINKS
|
R. W. Robinson, Table of n, a(n) for n = 1..28
|
|
CROSSREFS
|
Sequence in context: A145656 A009274 A019036 this_sequence A067299 A118325 A019037
Adjacent sequences: A005633 A005634 A005635 this_sequence A005637 A005638 A005639
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
