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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110499 Largest k such that n is the highest power in the factorization of binomial(2k,k). 0
4, 1056, 540928 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Checked all k < 10^8. a(1) has been proved. a(2) and a(3) are conjectured.

Checked all k < 10^9. a(4) is at least 537927682. - T. D. Noe, Jul 27 2005

LINKS

Table of n, a(n) for n=1..3.

EXAMPLE

a(1)=4 because binomial(8,4) is the largest squarefree central binomial coefficient. a(2)=1056 because binomial(2112,1056) is the largest cubefree.

CROSSREFS

Cf. A110495 (n such that binomial(2n, n) is cubefree).

Sequence in context: A004804 A221228 A159859 * A009013 A248656 A221383

Adjacent sequences:  A110496 A110497 A110498 * A110500 A110501 A110502

KEYWORD

bref,nonn

AUTHOR

T. D. Noe, Jul 22 2005

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified February 19 12:48 EST 2018. Contains 299333 sequences. (Running on oeis4.)