login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110495 Numbers n such that binomial(2n,n) is cubefree. 3
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; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

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 * A052347 A193299 A022773

Adjacent sequences:  A110492 A110493 A110494 * A110496 A110497 A110498

KEYWORD

nonn

AUTHOR

T. D. Noe (noe(AT)sspectra.com), Jul 22 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 10:01 EST 2012. Contains 205614 sequences.