|
Search: id:A133179
|
|
|
| A133179 |
|
A modular binomial sum transform of 2^n . |
|
+0
2
|
|
| 1, 1, 1, 3, 1, 3, 5, 15, 1, 3, 5, 15, 17, 51, 85, 255, 1, 3, 5, 15, 17, 51, 85, 255, 257, 771, 1285, 3855, 4369, 13107, 21845, 65535, 1, 3, 5, 15, 17, 51, 85, 255, 257, 771, 1285, 3855, 4369, 13107, 21845, 65535
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
FORMULA
|
a(n) = Sum_{k=0..floor(n/2), mod(binomial(n,k),2)2^k}.
|
|
EXAMPLE
|
A034868 is:
1;
1;
1, 2;
1, 3;
1, 4, 6;
1, 5, 10 ;...
A034868 modulo 2:
1;
1;
1, 0;
1, 1;
1, 0, 0;
1, 1, 0 ;...
a(0)=1*2^0 = 1;
a(1)=1*2^0 = 1;
a(2)=1*2^0+0*2^1 = 1;
a(3)=1*2^0+1*2^1 = 3;
a(4)=1*2^0+0*2^1+0*2^2 = 1
a(5)=1*2^0+1*2^1+0*2^2 = 3
|
|
CROSSREFS
|
Cf. A034868 A048896 A101692 A130047.
Sequence in context: A006257 A114144 A050820 this_sequence A146908 A049324 A131111
Adjacent sequences: A133176 A133177 A133178 this_sequence A133180 A133181 A133182
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Oct 10 2007
|
|
|
Search completed in 0.002 seconds
|
