login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A090617
Exponent of highest power of 8 dividing n!.
7
0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 10, 10, 10, 10, 11, 11, 11, 11, 12, 12, 13, 13, 13, 13, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 17, 17, 18, 18, 18, 18, 19, 19, 21, 21, 21, 21, 22, 22, 22, 22, 23, 23, 23, 23, 24, 24, 24, 24
OFFSET
0,9
FORMULA
a(n) = A090622(n, 8) = floor(A011371(n)/3) = floor((floor(n/2) + floor(n/4) + floor(n/8) + floor(n/16) + ...)/3).
a(n) = A244413(n!) . - R. J. Mathar, Jul 08 2021
EXAMPLE
a(8)=2 since 8! = 40320 = 8^2 * 630.
MATHEMATICA
Table[IntegerExponent[n!, 8], {n, 0, 80}] (* Harvey P. Dale, Mar 21 2013 *)
PROG
(Python 3.10+)
def A090617(n): return (n-bin(n).count('1'))//3 # Chai Wah Wu, Jul 09 2022
(PARI) a(n) = valuation(n!, 8); \\ Michel Marcus, Jul 10 2022
CROSSREFS
KEYWORD
nonn
AUTHOR
Henry Bottomley, Dec 06 2003
STATUS
approved