login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064458 Highest power of 11 dividing n!. 5
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,23

LINKS

Harry J. Smith, Table of n, a(n) for n = 0..1000

FORMULA

a(n) = floor[n/11] + floor[n/121] + floor[n/1331] + floor[n/14641] + ....

a(n) = (n-A053831(n))/10. [R. J. Mathar, Oct 17 2010]

MATHEMATICA

Table[t = 0; p = 11; While[s = Floor[n/p]; t = t + s; s > 0, p *= 11]; t, {n, 0, 100} ]

IntegerExponent[Range[0, 110]!, 11] (* Harvey P. Dale, Aug 07 2017 *)

PROG

(PARI) { for (n=0, 1000, a=0; p=11; while (s = n\p, a+=s; p*=11); write("b064458.txt", n, " ", a) ) } \\ Harry J. Smith, Sep 14 2009

(PARI) a(n) = valuation(n!, 11); \\ Michel Marcus, Apr 07 2016

CROSSREFS

Cf. A011371 and A054861.

Sequence in context: A226764 A206244 A206245 * A125891 A153675 A111895

Adjacent sequences:  A064455 A064456 A064457 * A064459 A064460 A064461

KEYWORD

easy,nonn

AUTHOR

Robert G. Wilson v, Oct 03 2001

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 October 20 02:35 EDT 2019. Contains 328244 sequences. (Running on oeis4.)