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.

A106844 Exponent of 2 in the prime factorization of A093641(n).

Original entry on oeis.org

0, 1, 0, 2, 0, 1, 0, 3, 1, 0, 2, 0, 1, 4, 0, 0, 2, 1, 0, 3, 1, 2, 0, 0, 5, 1, 0, 1, 3, 0, 0, 2, 1, 0, 4, 2, 0, 3, 1, 0, 0, 1, 6, 0, 2, 0, 0, 1, 2, 0, 4, 1, 0, 1, 3, 0, 2, 1, 5, 0, 0, 0, 3, 1, 0, 0, 4, 0, 2, 1, 1, 2, 0, 7, 0, 1, 3, 0, 0, 1, 1, 2, 0, 0, 3, 0, 1, 5, 0, 2, 1, 0, 2, 0, 4, 1, 0, 0, 3, 2, 0, 6, 0, 1
Offset: 1

Views

Author

Ralf Stephan, May 06 2005

Keywords

Comments

Write down all numbers of form 2^i*prime(j), j>0, i>=0, sort them, then extract i.

Crossrefs

Programs

  • Mathematica
    f[n_] := Module[{e = IntegerExponent[n, 2]}, If[!CompositeQ[n / 2^e], e, Nothing]]; Array[f, 200] (* Amiram Eldar, Aug 24 2024 *)

Formula

a(n) = A007814(A093641(n)).

Extensions

a(1)-a(2) inserted by Amiram Eldar, Aug 24 2024