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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110494 Least k such that prime(n)^2 divides binomial(2k,k). 4
3, 5, 13, 25, 61, 85, 145, 181, 265, 421, 481, 685, 841, 925, 1105, 1405, 1741, 1861, 2245, 2521, 2665, 3121, 3445, 3961, 4705, 5101, 5305, 5725, 5941, 6385, 8065, 8581, 9385, 9661, 11101, 11401, 12325, 13285, 13945, 14965 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

For prime p > sqrt(2n), p^2 does not divide binomial(2n,n).

FORMULA

a(n)=(prime(n)^2+1)/2 for n>1

a(n)=A066885(n), n>1. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 18 2008]

MATHEMATICA

t=Table[f=FactorInteger[Binomial[2n, n]]; s=Select[f, #[[2]]>1&]; If[s=={}, 0, s[[ -1, 1]]], {n, 100}]; Table[p=Prime[i]; First[Flatten[Position[t, p]]], {i, PrimePi[Max[t]]}]

CROSSREFS

Cf. A110493 (largest prime p such that p^2 divides binomial(2n, n)).

Sequence in context: A026766 A026709 A159290 * A098615 A026720 A026003

Adjacent sequences:  A110491 A110492 A110493 * A110495 A110496 A110497

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 15 10:28 EST 2012. Contains 205763 sequences.