This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A090620 Highest power of 13 dividing n!. 6
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,27 LINKS T. D. Noe, Table of n, a(n) for n = 0..1000 FORMULA a(n) = A090622(n, 13) = A090623(n, 13) = [n/13]+[n/169]+[n/2197]+... a(n) = (n-A053833(n))/12. [From R. J. Mathar, Oct 17 2010] a(n) = n/12 + O(log n). - Charles R Greathouse IV, Aug 06 2012 MATHEMATICA IntegerExponent[Range[0, 110]!, 13] (* Harvey P. Dale, Aug 22 2011 *) FoldList[Plus, 0, IntegerExponent[Range[100], 13]] (* T. D. Noe, Apr 10 2012 *) PROG (PARI) a(n)=my(t); while(n, t+=n\=13); t \\ Charles R Greathouse IV, Aug 06 2012 CROSSREFS Cf. A011371, A054861. Sequence in context: A211663 A000195 A135663 * A151659 A057467 A074594 Adjacent sequences:  A090617 A090618 A090619 * A090621 A090622 A090623 KEYWORD nonn,easy AUTHOR Henry Bottomley, Dec 06 2003 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 December 13 22:07 EST 2018. Contains 318087 sequences. (Running on oeis4.)