|
Search: id:A006897
|
|
|
| A006897 |
|
Hierarchical linear models on n factors allowing 2-way interactions; or graphs with <= n nodes.
(Formerly M1153)
|
|
+0
1
|
|
| 1, 2, 4, 8, 19, 53, 209, 1253, 13599, 288267, 12293435, 1031291299, 166122463891, 50668153831843, 29104823811067331, 31455590793615376099, 64032471295321173271027
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
EXAMPLE
|
a(2)=4 includes null graph [], G1=[o], G2=[o o], G3=[o-o].
|
|
CROSSREFS
|
Partial sums of A000088.
Sequence in context: A100133 A099598 A128816 this_sequence A034767 A005518 A014225
Adjacent sequences: A006894 A006895 A006896 this_sequence A006898 A006899 A006900
|
|
KEYWORD
|
easy,nonn,nice
|
|
AUTHOR
|
C. L. Mallows (colinm(AT)research.avayalabs.com)
|
|
|
Search completed in 0.002 seconds
|
