login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076733 Largest k such that k! divides C(2n,n). 3
2, 3, 2, 2, 3, 3, 4, 3, 2, 2, 4, 2, 2, 5, 6, 3, 3, 3, 5, 3, 5, 5, 6, 3, 4, 4, 2, 2, 5, 2, 2, 3, 3, 3, 4, 2, 2, 5, 2, 2, 5, 5, 7, 5, 7, 7, 7, 3, 5, 4, 4, 4, 7, 5, 4, 4, 4, 5, 6, 4, 4, 4, 5, 3, 3, 3, 5, 3, 5, 5, 6, 3, 5, 5, 7, 5, 7, 7, 7, 3, 2, 2, 5, 2, 2, 7, 5, 5, 7, 2, 2, 5, 2, 2, 7, 3, 5, 5, 5, 5, 6, 5, 5, 5, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

All a(n) >= 2, with a(n) = 2 if and only if n is in A005836. - Robert Israel, Feb 01 2019

LINKS

Robert Israel, Table of n, a(n) for n = 1..10000

MAPLE

f:= proc(n) local x, k;

  x:= binomial(2*n, n);

  for k from 2 do if not (x/k!)::integer then return k-1 fi od

end proc:

map(f, [$1..105]); # Robert Israel, Feb 01 2019

PROG

(PARI) a(n)=if(n<0, 0, k=1; while(binomial(2*n, n)%(k!) == 0, k++); k-1)

CROSSREFS

Cf. A005836, A055881.

Sequence in context: A051686 A079294 A242789 * A079643 A329317 A118480

Adjacent sequences:  A076730 A076731 A076732 * A076734 A076735 A076736

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Oct 28 2002

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 21 04:40 EDT 2021. Contains 343146 sequences. (Running on oeis4.)