|
Search: id:A110495
|
|
|
| A110495 |
|
Numbers n such that binomial(2n,n) is cubefree. |
|
+0
4
|
|
| 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 16, 18, 20, 24, 32, 33, 34, 36, 40, 48, 65, 66, 72, 96, 136, 144, 192, 256, 258, 264, 288, 520, 576, 768, 1056
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
No others < 15000. This sequence is probably complete. According to Sander, this sequence - and the sequence for any power - is finite.
|
|
REFERENCES
|
J. W. Sander, A story of binomial coefficients and primes, Amer. Math. Monthly, Vol. 102, No. 9 (Nov. 1995), 802-807.
|
|
MATHEMATICA
|
t3=Table[f=FactorInteger[Binomial[2n, n]]; s=Select[f, #[[2]]>2&]; If[s=={}, 0, s[[ -1, 1]]], {n, 15000}]; Flatten[Position[t3, 0]]
|
|
CROSSREFS
|
Cf. A110496 (least k such that prime(n)^3 divides binomial(2k, k)).
Sequence in context: A093863 A091902 A067698 this_sequence A052347 A022773 A049997
Adjacent sequences: A110492 A110493 A110494 this_sequence A110496 A110497 A110498
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
T. D. Noe (noe(AT)sspectra.com), Jul 22 2005
|
|
|
Search completed in 0.002 seconds
|
