Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110499
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A110499 Largest k such that n is the highest power in the factorization of binomial(2k,k). +0
1
4, 1056, 540928 (list; graph; listen)
OFFSET

1,1

COMMENT

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 (noe(AT)sspectra.com), Jul 27 2005

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: A013780 A139300 A004804 this_sequence A009013 A079711 A036107

Adjacent sequences: A110496 A110497 A110498 this_sequence A110500 A110501 A110502

KEYWORD

bref,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research