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.

A383005 Exponent of the highest power of 2 dividing the n-th biquadratefree number.

Original entry on oeis.org

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

Views

Author

Amiram Eldar, Apr 12 2025

Keywords

Comments

First differs from A254990 at n = 31.

Crossrefs

Programs

  • Mathematica
    biqFreeQ[n_] := AllTrue[FactorInteger[n][[;; , 2]], # < 4 &]; IntegerExponent[Select[Range[200], biqFreeQ], 2]
  • PARI
    isbiqfree(n) = {my(f = factor(n)); for(i=1, #f~, if(f[i, 2] > 3, return (0))); 1; }
    list(lim) = for(k = 1, lim, if(isbiqfree(k), print1(valuation(k, 2), ", ")));

Formula

a(n) = A007814(A046100(n)).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 11/15.
In general, the asymptotic mean of the exponent of the highest power of 2 dividing the n-th k-free number (number that is not divisible by a k-th power other than 1), for k >= 2, is 1 - k/(2^k-1).