|
Search: id:A062527
|
|
|
| A062527 |
|
Smallest number (>1) which appears at least n times in Pascal's triangle. |
|
+0
2
|
| |
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Singmaster's conjecture is that this sequence is finite.
|
|
REFERENCES
|
H. L. Abbott, P. Erdos and D. Hanson, On the number of times an integer occurs as a binomial coefficient, American Mathematical Monthly 81 (1974) 256-261.
David Singmaster, How often does an integer occur as a binomial coefficient? American Mathematical Monthly 78 (1971) 385-386.
David Singmaster, Repeated binomial coefficients and Fibonacci numbers, Fibonacci Quarterly 13 (1975) 295-298.
|
|
LINKS
|
FTL Magazine, One Thousand and One Coincidences
|
|
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)
|
|
CROSSREFS
|
Cf. A003015, A003016, A006987, A007318, A059233.
Adjacent sequences: A062524 A062525 A062526 this_sequence A062528 A062529 A062530
Sequence in context: A111275 A054357 A056606 this_sequence A038752 A125714 A004038
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
Henry Bottomley (se16(AT)btinternet.com), Jul 10 2001
|
|
|
Search completed in 0.002 seconds
|
