cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A244413 Exponent of highest power of 8 dividing n.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0
Offset: 1

Views

Author

Wolfdieter Lang, Jun 27 2014

Keywords

Comments

This is the member g = 8 in the g-family of sequences, g integer >= 2, call it phi(g,n), n >= 1. In the Mahler reference, Lemma 2, pp. 6-7, this exponent is called f = -phi if g divides r = n (s = 1 there), and f = 0 if g does not divide r = n (s = 1 there).

References

  • Kurt Mahler, p-adic numbers and their functions, 2nd ed., Cambridge University press, 1981.

Crossrefs

Programs

Formula

n = 8^a(n)*m with a(n) nonnegative integer such that 8 does not divide m, for n >= 1.
O.g.f.: Sum_{k>=1} x^(8^k)/(1-x^(8^k)).
Asymptotic mean: lim_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 1/7. - Amiram Eldar, Jan 17 2022
a(n) = floor(A007814(n)/3). - Alan Michael Gómez Calderón, Jul 25 2024