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.

A064742 Total number of primes (with multiplicity) dividing A064413(n).

Original entry on oeis.org

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

Views

Author

N. J. A. Sloane, Oct 18 2001

Keywords

Crossrefs

Sum of "digits" of A064743.

Programs

  • Mathematica
    terms = 105;
    ekg[s_] := Block[{m = s[[-1]], k = 3}, While[MemberQ[s, k] || GCD[m, k] == 1, k++]; Append[s, k]];
    EKG = Nest[ekg, {1, 2}, terms-2];
    PrimeOmega /@ EKG (* Jean-François Alcover, Sep 02 2018, after Robert G. Wilson v in A064413 *)

Formula

a(n) = A001222(A064413(n)). - Michel Marcus, Aug 21 2023

Extensions

More terms from Vladeta Jovovic, Oct 20 2001