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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A000999 5^a(n) divides C(2n,n). 1
 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 2, 2, 1, 1, 1, 2, 2, 1, 1, 1, 2, 2, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 2, 2, 1, 1, 1, 2, 2, 1, 1, 1, 2, 2, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 3, 3, 2, 2, 2, 3, 3, 2, 2, 2, 3, 3, 1, 1, 1, 2, 2, 1, 1, 1, 2, 2, 1, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,14 LINKS T. D. Noe, Table of n, a(n) for n = 0..1000 MATHEMATICA Table[IntegerExponent[Binomial[2*n, n], 5], {n, 0, 100}] (* T. D. Noe, Jun 21 2012 *) PROG (PARI) a(n)=if(n<0, 0, valuation(binomial(2*n, n), 5)) CROSSREFS Cf. A000984. Sequence in context: A317756 A039998 A316089 * A175921 A303828 A025451 Adjacent sequences:  A000996 A000997 A000998 * A001000 A001001 A001002 KEYWORD nonn,easy AUTHOR EXTENSIONS More terms from Michael Somos, Jun 27, 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.

Last modified September 19 05:33 EDT 2020. Contains 337176 sequences. (Running on oeis4.)