|
Search: id:A100309
|
|
|
| A100309 |
|
Modulo 2 binomial transform of 6^n. |
|
+0
5
|
|
| 1, 7, 37, 259, 1297, 9079, 47989, 335923, 1679617, 11757319, 62145829, 435020803, 2178463249, 15249242743, 80603140213, 564221981491, 2821109907457, 19747769352199, 104381066575909, 730667466031363, 3658979549971729
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
6^n may be retrieved through 6^n=sum{k=0..n, (-1)^A010060(n-k)*mod(binomial(n,k),2)A100309(k)}.
|
|
FORMULA
|
a(n)=sum{k=0..n, mod(binomial(n, k), 2)6^k}.
|
|
CROSSREFS
|
Cf. A001316, A001317, A038183, A100307, A100308, A100310, A100311.
Sequence in context: A039938 A102760 A096965 this_sequence A089677 A075996 A093168
Adjacent sequences: A100306 A100307 A100308 this_sequence A100310 A100311 A100312
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Paul Barry (pbarry(AT)wit.ie), Dec 06 2004
|
|
|
Search completed in 0.002 seconds
|
