|
Search: id:A006129
|
|
|
| A006129 |
|
a(0),a(1),a(2),... satisfy Sum a(k) binomial(n,k) (k=0..n) = 2^binomial(n,2), for n=0.1,...
(Formerly M3678)
|
|
+0
10
|
|
| 1, 0, 1, 4, 41, 768, 27449, 1887284, 252522481, 66376424160, 34509011894545, 35645504882731588, 73356937912127722841, 301275024444053951967648, 2471655539737552842139838345, 40527712706903544101000417059892
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
Also labeled graphs on n unisolated nodes (inverse binomial transform of A006125).
|
|
LINKS
|
N. J. A. Sloane, Transforms
|
|
FORMULA
|
a(n)=sum_{k=0..n} (-1)^(n-k)*binomial(n, k)*2^binomial(k, 2).
|
|
EXAMPLE
|
2^binomial(n,2)=1+binomial(n,2)+4*binomial(n,3)+41*binomial(n,4)+768*binomial(n,5)+...
|
|
CROSSREFS
|
Adjacent sequences: A006126 A006127 A006128 this_sequence A006130 A006131 A006132
Sequence in context: A134277 A085340 A001908 this_sequence A022515 A059730 A006825
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
C. L. Mallows (colinm(AT)research.avayalabs.com)
|
|
EXTENSIONS
|
More terms and additional comments from Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 09 2000
|
|
|
Search completed in 0.002 seconds
|
