A101680 A modular binomial transform of 10^n.
1, 11, 111, 1011, 10111, 111011, 1100111, 10001011, 100010111, 1100111011, 11101100111, 101110001011, 1011000010111, 11100000111011, 110000001100111, 1000000010001011, 10000000100010111, 110000001100111011, 1110000011101100111, 10110000101110001011, 101110001011000010111
Offset: 0
Programs
-
PARI
a(n) = sum(k=0, n, lift(Mod(binomial(2*n-k, k), 2))*10^k); \\ Michel Marcus, Jul 31 2025
-
Python
def A101680(n): return sum(int(not ~((n<<1)-k)&k)*10**k for k in range(n+1)) # Chai Wah Wu, Jul 30 2025
Formula
a(n) = Sum{k=0..n} mod(binomial(2n-k, k), 2)*10^k<;
Extensions
More terms from Michel Marcus, Jul 31 2025