proposed
approved
Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
proposed
approved
editing
proposed
return c>>n # Chai Wah Wu, Oct 09 2024
(Python)
def A376531(n):
m, r, c, b, d = (1<<n)-1, n**2, 1, n**2, 1
for k in range(1, r+1):
c += b//d&m
b *= r-k
d *= k+1
return c>>n # Chai Wah Wu, Oct 09 2024
approved
editing
proposed
approved
editing
proposed
Table[(1/2^n)*Sum[Mod[Binomial[n^2, k], 2^n], {k, 0, n^2}], {n, 60}] (* James C. McMahon, Oct 07 2024 *)
approved
editing
editing
approved
(1+x)^49 (mod 2^7): [1, 49, 24, 120, 36, 68, 72, 40, 18, 82, 72, 104, 52, 20, 88, 120, 95, 79, 112, 48, 72, 8, 80, 16, 60, 60, 16, 80, 8, 72, 48, 112, 79, 95, 120, 88, 20, 52, 104, 72, 82, 18, 40, 72, 68, 36, 120, 24, 49, 1];
approved
editing
Paul D. Hanna, <a href="/A376531/b376531_1.txt">Table of n, a(n) for n = 1..235</a>