|
Search: id:A101692
|
|
|
| A101692 |
|
A modular binomial sum transform of 2^n. |
|
+0
3
|
|
| 1, 1, 5, 1, 5, 17, 85, 1, 5, 17, 85, 257, 1285, 4369, 21845, 1, 5, 17, 85, 257, 1285, 4369, 21845, 65537, 327685, 1114129, 5570645, 16843009, 84215045, 286331153, 1431655765, 1, 5, 17, 85, 257, 1285, 4369, 21845, 65537, 327685, 1114129, 5570645
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
a(2^n) is 1,5,5,5,5,... a(2^n+1) is 5,1,17,17,17,... a(2(2^n+1)) is 5,85,85,85,.... a(2^n)a(2^n+1) is 5,5,85,85,85,...
|
|
FORMULA
|
a(n)=sum{k=0..n, mod(binomial(2n+2, k), 2)2^k}
a(n)=Sum_{k, 0<=k<=n}A128937(n,k)*2^(n-k) . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Oct 09 2007
|
|
CROSSREFS
|
Cf. A001045, A048896.
Sequence in context: A143384 A046611 A145825 this_sequence A105060 A066805 A028284
Adjacent sequences: A101689 A101690 A101691 this_sequence A101693 A101694 A101695
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Paul Barry (pbarry(AT)wit.ie), Dec 11 2004
|
|
|
Search completed in 0.002 seconds
|
