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.

A372505 a(n) = log_2(A368473(n)).

Original entry on oeis.org

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

Views

Author

Amiram Eldar, May 04 2024

Keywords

Comments

The first position of k, for k = 0, 1, ..., is 1, 4, 15, 126, 1134, ..., which is the position of A085629(2^k) in A138302.

Crossrefs

Programs

  • Mathematica
    f[n_] := Module[{p = Times @@ FactorInteger[n][[;; , 2]], e}, e = IntegerExponent[p, 2]; If[p == 2^e, e, Nothing]]; Array[f, 150]
  • PARI
    lista(kmax) = {my(p, e); for(k = 1, kmax, p = vecprod(factor(k)[, 2]); e = valuation(p, 2); if(p >> e == 1, print1(e, ", ")));}

Formula

a(n) = log_2(A005361(A138302(n))).