|
Search: id:A006896
|
|
|
| A006896 |
|
Hierarchical linear models on n factors allowing 2-way interactions; or labeled graphs on <= n nodes.
(Formerly M1520)
|
|
+0
7
|
|
| 1, 2, 5, 18, 113, 1450, 40069, 2350602, 286192513, 71213783666, 35883905263781, 36419649682706466, 74221659280476136241, 303193505953871645562970, 2480118046704094643352358501, 40601989176407026666590990422106
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
FORMULA
|
1 + C(n, 1) + C(n, 2) 2 + C(n, 3) 2^3 + C(n, 4) 2^6 + ... + C(n, n) 2^n(n-1)/2.
|
|
MAPLE
|
A006896 := proc(n) local k; 1+binomial(n, 1)+sum(binomial(n, k)*2^(1/2*k*(k-1)), k = 2 .. n) end;
|
|
PROGRAM
|
(PARI) a(n)=sum(k=0, n, binomial(n, k)*2^((k^2-k)/2))
|
|
CROSSREFS
|
a(n)=1+A004140(n).
Sequence in context: A007769 A005805 A058338 this_sequence A125625 A097584 A062097
Adjacent sequences: A006893 A006894 A006895 this_sequence A006897 A006898 A006899
|
|
KEYWORD
|
easy,nonn,nice
|
|
AUTHOR
|
njas, C. L. Mallows (colinm(AT)research.avayalabs.com), Simon Plouffe (plouffe(AT)math.uqam.ca)
|
|
EXTENSIONS
|
Error in formula line corrected Sep 15 1997 (thanks to R. K. Guy for pointing this out)
|
|
|
Search completed in 0.002 seconds
|
