|
Search: id:A099893
|
|
| |
|
| 0, 1, 3, 0, 7, 0, 0, 0, 15, 0, 0, 0, 0, 0, 0, 0, 31, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 63, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 127
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
See A099884 for the definitions of the XOR BINOMIAL transform and the XOR difference triangle.
|
|
FORMULA
|
a(2^n) = 2^(n+1)-1 for n>0, with a(0)=0, and a(k)=0 otherwise. a(n) = SumXOR_{i=0..n} (C(n, i)mod 2)*A006068(n-i) and SumXOR is summation under XOR.
|
|
PROGRAM
|
(PARI) {a(n)=local(B); B=0; for(i=0, n, B=bitxor(B, binomial(n, i)%2*A006068(n-i) )); B}
|
|
CROSSREFS
|
Cf. A099884, A006068, A099894.
Adjacent sequences: A099890 A099891 A099892 this_sequence A099894 A099895 A099896
Sequence in context: A083350 A002043 A137436 this_sequence A135534 A077896 A046269
|
|
KEYWORD
|
nonn,mult
|
|
AUTHOR
|
Paul D. Hanna (pauldhanna(AT)juno.com), Oct 29 2004
|
|
|
Search completed in 0.002 seconds
|
