|
Search: id:A100307
|
|
|
| A100307 |
|
Modulo 2 binomial transform of 3^n. |
|
+0
5
|
|
| 1, 4, 10, 40, 82, 328, 820, 3280, 6562, 26248, 65620, 262480, 538084, 2152336, 5380840, 21523360, 43046722, 172186888, 430467220, 1721868880, 3529831204, 14119324816, 35298312040, 141193248160, 282472589764, 1129890359056
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
3^n may be retrieved through 3^n=sum{k=0..n, (-1)^A010060(n-k)*mod(binomial(n,k),2)A100307}.
|
|
FORMULA
|
a(n)=sum{k=0..n, mod(binomial(n, k), 2)3^k}.
|
|
CROSSREFS
|
Cf. A001316, A001317, A038183, A100308, A100309, A100310, A100311.
Sequence in context: A151447 A149203 A038168 this_sequence A077811 A136855 A136860
Adjacent sequences: A100304 A100305 A100306 this_sequence A100308 A100309 A100310
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Paul Barry (pbarry(AT)wit.ie), Dec 06 2004
|
|
|
Search completed in 0.002 seconds
|
