|
Search: id:A005637
|
|
|
| A005637 |
|
Number of n-node graphs without nodes of degree 2.
(Formerly M0352)
|
|
+0
1
|
|
| 1, 1, 2, 2, 5, 10, 45, 284, 3960, 110356, 6153615, 640014800, 120777999811, 41158185726269, 25486682538903526, 28943747337743989421, 60828392582465943631269, 238439312273287947102629832
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
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, 1978.
|
|
LINKS
|
R. W. Robinson, Table of n, a(n) for n = 0..28
|
|
CROSSREFS
|
Sequence in context: A075125 A081374 A117400 this_sequence A104080 A078405 A109278
Adjacent sequences: A005634 A005635 A005636 this_sequence A005638 A005639 A005640
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
