The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A099893 XOR BINOMIAL transform of A006068 (inverse Gray code). 1
 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; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS See A099884 for the definitions of the XOR BINOMIAL transform and the XOR difference triangle. LINKS Table of n, a(n) for n=0..64. 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. PROG (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. Sequence in context: A002043 A171002 A137436 * A135534 A346516 A337767 Adjacent sequences: A099890 A099891 A099892 * A099894 A099895 A099896 KEYWORD nonn,mult AUTHOR Paul D. Hanna, Oct 29 2004 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 5 18:51 EDT 2024. Contains 374954 sequences. (Running on oeis4.)