|
Search: id:A064459
|
|
|
| A064459 |
|
Highest power of 12 dividing n!. |
|
+0
3
|
|
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8
(list; graph; listen)
|
|
|
OFFSET
|
0,25
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=0,...,1000
|
|
FORMULA
|
floor[n/12] + floor[n/144] + floor[n/1728] + floor[n/20736] + ....
|
|
MATHEMATICA
|
Table[t = 0; p = 12; While[s = Floor[n/p]; t = t + s; s > 0, p *= 12]; t, {n, 0, 100} ]
|
|
PROGRAM
|
(PARI) { for (n=0, 1000, a=0; p=12; while (s = n\p, a+=s; p*=12); write("b064459.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 15 2009]
|
|
CROSSREFS
|
Cf. A011371 and A054861.
Sequence in context: A095861 A111855 A071701 this_sequence A082996 A094382 A146167
Adjacent sequences: A064456 A064457 A064458 this_sequence A064460 A064461 A064462
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com), Oct 03 2001
|
|
|
Search completed in 0.002 seconds
|
