Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060308
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060308 Largest prime <= 2n. +0
18
2, 3, 5, 7, 7, 11, 13, 13, 17, 19, 19, 23, 23, 23, 29, 31, 31, 31, 37, 37, 41, 43, 43, 47, 47, 47, 53, 53, 53, 59, 61, 61, 61, 67, 67, 71, 73, 73, 73, 79, 79, 83, 83, 83, 89, 89, 89, 89, 97, 97, 101, 103, 103, 107, 109, 109, 113, 113, 113, 113, 113, 113, 113, 127, 127, 131 (list; graph; listen)
OFFSET

1,1

COMMENT

a(n) is the smallest k such that C(2n,n) divides k!. - Benoit Cloitre (benoit7848c(AT)orange.fr), May 30 2002

a(n) is largest prime factor of C(2n,n) = (2n)!/(n!)^2. - Alexander Adamchuk (alex(AT)kolmogorov.com), Jul 11 2006

FORMULA

a(n) = Max[FactorInteger[(2n)!/(n!)^2]]. - Alexander Adamchuk (alex(AT)kolmogorov.com), Jul 11 2006

EXAMPLE

n=1,2n=2,p(1)=2=a(1) is the largest prime not exceeding 2

MAPLE

with(numtheory): [seq(prevprime(2*i), i=2..256)];

MATHEMATICA

Table[Max[FactorInteger[(2n)!/(n!)^2]], {n, 1, 100}] - Alexander Adamchuk (alex(AT)kolmogorov.com), Jul 11 2006

CROSSREFS

Cf. A020482, A049653, A060266-A060268, A060264. Apart from initial term, same as A060265.

Sequence in context: A156900 A039734 A020482 this_sequence A064142 A067792 A119317

Adjacent sequences: A060305 A060306 A060307 this_sequence A060309 A060310 A060311

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Mar 27 2001

EXTENSIONS

More terms from Alexander Adamchuk (alex(AT)kolmogorov.com), Jul 11 2006

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 December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research