|
Search: id:A064458
|
|
|
| A064458 |
|
Highest power of 11 dividing n!. |
|
+0
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; listen)
|
|
|
OFFSET
|
0,23
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=0,...,1000
|
|
FORMULA
|
floor[n/11] + floor[n/121] + floor[n/1331] + floor[n/14641] + ....
|
|
MATHEMATICA
|
Table[t = 0; p = 11; While[s = Floor[n/p]; t = t + s; s > 0, p *= 11]; t, {n, 0, 100} ]
|
|
PROGRAM
|
(PARI) { for (n=0, 1000, a=0; p=11; while (s = n\p, a+=s; p*=11); write("b064458.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 14 2009]
|
|
CROSSREFS
|
Cf. A011371 and A054861.
Sequence in context: A067394 A076925 A100961 this_sequence A125891 A153675 A111895
Adjacent sequences: A064455 A064456 A064457 this_sequence A064459 A064460 A064461
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com), Oct 03 2001
|
|
EXTENSIONS
|
Corrected my PATI program for offset 0 by Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 15 2009
|
|
|
Search completed in 0.002 seconds
|
