|
Search: id:A099892
|
|
|
| A099892 |
|
XOR BINOMIAL transform of A003188 (Gray code numbers); also the main diagonal of the XOR difference triangle A099891. |
|
+0
2
|
|
| 0, 1, 3, 0, 6, 0, 0, 0, 12, 0, 0, 0, 0, 0, 0, 0, 24, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 48, 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, 96
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
See A099884 for the definitions of the XOR BINOMIAL transform and the XOR difference triangle.
Multiplicative with a(2^e) =3*2^(e-1), a(p^e) = 0 otherwise. David W. Wilson (davidwwilson(AT)comcast.net) Jun 12, 2005.
|
|
FORMULA
|
a(2^n) = 3*2^(n-1) for n>0, with a(0)=0, a(1) = 1 and a(k)=0 otherwise. a(n) = SumXOR_{i=0..n} (C(n, i)mod 2)*A003188(n-i), where A003188(k)=bitxor(k, [k/2]) 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*(bitxor((n-i), (n-i)\2)))); B}
|
|
CROSSREFS
|
Cf. A099884, A003188, A099891.
Sequence in context: A088969 A009780 A129502 this_sequence A060147 A092731 A161829
Adjacent sequences: A099889 A099890 A099891 this_sequence A099893 A099894 A099895
|
|
KEYWORD
|
nonn,mult
|
|
AUTHOR
|
Paul D. Hanna (pauldhanna(AT)juno.com), Oct 29 2004
|
|
|
Search completed in 0.002 seconds
|
