|
Search: id:A100311
|
|
|
| A100311 |
|
Modulo 2 binomial transform of 8^n. |
|
+0
5
|
|
| 1, 9, 65, 585, 4097, 36873, 266305, 2396745, 16777217, 150994953, 1090519105, 9814671945, 68736258049, 618626322441, 4467856773185, 40210710958665, 281474976710657, 2533274790395913, 18295873486192705, 164662861375734345
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
8^n may be retrieved through 8^n=sum{k=0..n, (-1)^A010060(n-k)*mod(binomial(n,k),2)A100311(k)}.
|
|
FORMULA
|
a(n)=sum{k=0..n, mod(binomial(n, k), 2)8^k}.
|
|
CROSSREFS
|
Cf. A001316, A001317, A038183, A100307, A100308, A100309, A100310.
Sequence in context: A154996 A128195 A103459 this_sequence A120286 A152581 A122733
Adjacent sequences: A100308 A100309 A100310 this_sequence A100312 A100313 A100314
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Paul Barry (pbarry(AT)wit.ie), Dec 06 2004
|
|
|
Search completed in 0.002 seconds
|
