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.

A124874 Number of distinct primes dividing A007408(n).

Original entry on oeis.org

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

Views

Author

M. F. Hasler, Nov 11 2006

Keywords

Examples

			a(1) = 0 since no prime divides A007408(1) = 1,
a(2) = 1 since 3 is the only prime dividing A007408(2) = 9,
a(3) = 1 since A007408(3) = 251 is prime,
a(4) = 3 since A007408(4) = 5 * 11 * 37,
a(6) = 3 since 7, 11, 53 are the only primes dividing A007408(6) = 7^2 * 11 * 53.
		

Crossrefs

Programs

  • Maple
    seq( (nops@op)(2,(ifactors@A007408)(n)),n=1..25);
  • Mathematica
    Table[PrimeNu[Numerator[Sum[1/k^3, {k, 1, n}]]], {n, 1, 50}] (* Amiram Eldar, Feb 09 2020 *)

Formula

a(n) = A001221(A007408(n)).

Extensions

More terms from Amiram Eldar, Feb 09 2020