Modulo 2 Binomial Transform

Paul D. Hanna pauldhanna at
Sat Dec 25 22:28:56 CET 2004

One last note regarding Paul Barry's Modulo 2 Binomial Transform. 
If we apply the triangle formed by reading Pascal's triangle mod 2: 
as a transformation on a sequence A, and apply this transform M times, 
the formula for this (Mod 2 Binomial transformation)^M of A is: 
(1)  a(n) = Sum_{k=0..n} M^A000120(k)*(C(n,k) Mod 2)*A(k) 
where A000120(k) = number of 1's in binary expansion of k. 
This can be expressed using PARI code as:
A special case exists when A(n) = B^n for integer B; 
for then (1) is equivalent to the product formula: 
(2)  a(n) = Product_{k=0..[log_2(n)]} ( B^(2^k) + M )^b(n,k) 
where b(n,k) = coefficient of 2^k in the binary expansion of n. 
This can be expressed using PARI code as:
The product formula (2) explains the factorization behavior noted
(Merry Christmas)^2,
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <>

More information about the SeqFan mailing list