A060430 Residue C(2^n,n) mod C(2^n,2).

0, 0, 0, 20, 0, 1344, 0, 8160, 0, 349184, 0, 1397760, 0, 0, 306774016, 268431360, 0, 7635468288, 0, 494779760640, 942438088704, 0, 0, 105553109975040, 0, 0, 0, 6004799480791040, 0, 192153583922184192, 0, 576460752169205760, 0, 49191317527028826112, 0

Offset

1,4

Links

Chai Wah Wu, Table of n, a(n) for n = 1..1664 (terms 1..200 from Harry J. Smith)

Formula

a(n) = A014070(n) mod A006516(n).

Maple

for n from 1 to 60 do printf(`%d, `, binomial(2^n, n) mod binomial(2^n, 2)) od:

Mathematica

Table[Mod[Binomial[2^n, n], Binomial[2^n, 2]], {n, 40}] (* Harvey P. Dale, Feb 11 2015 *)

Prog

(Python)
from math import comb
def A060430(n): return comb(m:=1<<n, n)%comb(m, 2) # Chai Wah Wu, Aug 01 2025

Crossrefs

Cf. A014070, A006516.

Sequence in context: A221335 A298672 A198800 * A365911 A040404 A040405

Adjacent sequences: A060427 A060428 A060429 * A060431 A060432 A060433

Keyword

easy,nonn

Author

Labos Elemer, Apr 11 2001

Extensions

More terms from James Sellers, Apr 12 2001

Offset corrected by Harry J. Smith, Jul 05 2009

Status

approved