cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A110499 Largest k such that n is the highest power in the factorization of binomial(2k,k).

Original entry on oeis.org

4, 1056, 540928
Offset: 1

Views

Author

T. D. Noe, Jul 22 2005

Keywords

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

Examples

			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).