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.

A106482 Number of prime factors (with multiplicity) of A007588(n).

Original entry on oeis.org

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

Views

Author

Jonathan Vos Post, May 03 2005

Keywords

Examples

			73*(2*73^2 - 1) = 777961 = 73 * 10657, which has two prime factors, so a(73) = 2.
100*(2*100^2 - 1) = 1999900 = 2^2 * 5^2 * 7 * 2857 has 6 prime factors.
		

Crossrefs

Programs

  • Maple
    a:= n-> numtheory[bigomega](n*(2*n^2-1)):
    seq(a(n), n=0..100);  # Alois P. Heinz, Mar 03 2023

Formula

a(n) = A001222(A007588(n)).

Extensions

a(78) corrected by Sean A. Irvine, Mar 03 2023