

A062527


Smallest number (>1) which appears at least n times in Pascal's triangle.


2




OFFSET

1,1


COMMENTS

Singmaster's conjecture is that this sequence is finite.


LINKS



EXAMPLE

a(8)=3003 since 3003 =C(3003,1) =C(3003,3002) =C(78,2) =C(78,76) =C(15,5) =C(15,10) =C(14,6) = C(14,8).


MATHEMATICA

(* Computation lasts a few minutes *) max = 4000; Clear[cnt]; cnt[_] = 0; Do[b = Binomial[n, k]; If[b <= max, cnt[b] += 1], {n, 0, max}, {k, 1, n  1}]; sel = Select[Table[{b, cnt[b]}, {b, 1, max }], #[[2]] >= 1&]; a[n_] := Select[sel, #[[2]] >= n&][[1, 1]]; Array[a, 8] (* JeanFrançois Alcover, Oct 05 2015 *)


CROSSREFS



KEYWORD

nonn,nice


AUTHOR



STATUS

approved



