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.

A383006 Exponent of the highest power of 2 dividing the n-th powerful number.

Original entry on oeis.org

0, 2, 3, 0, 4, 0, 0, 5, 2, 0, 6, 3, 0, 2, 2, 0, 0, 7, 4, 0, 2, 3, 3, 0, 0, 8, 5, 0, 2, 0, 0, 3, 4, 4, 0, 2, 2, 9, 0, 6, 0, 3, 0, 2, 0, 4, 5, 0, 5, 2, 0, 3, 2, 3, 10, 0, 0, 7, 2, 0, 4, 0, 0, 3, 0, 2, 2, 0, 5, 6, 0, 6, 2, 3, 0, 4, 3, 4, 0, 11, 2, 0, 0, 0, 8, 3, 0
Offset: 1

Views

Author

Amiram Eldar, Apr 12 2025

Keywords

Crossrefs

Programs

  • Mathematica
    IntegerExponent[Select[Range[5000], # == 1 || Min[FactorInteger[#][[;; , 2]]] > 1 &], 2]
  • PARI
    list(lim) = for(k = 1, lim, if(ispowerful(k), print1(valuation(k, 2), ", ")));

Formula

a(n) = A007814(A001694(n)).
a(A363189(n)) = 0.
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = (11 + 6*sqrt(2))/7 = 2.7836116... .