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.

A212177 Number of exponents >= 2 in the canonical prime factorization of the n-th nonsquarefree number (A013929(n)).

Original entry on oeis.org

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

Views

Author

Matthew Vandermast, Jun 03 2012

Keywords

Comments

Length of second signature of A013929(n) (cf. A212172).

Examples

			24 = 2^3*3 has 1 exponent of size 2 or greater in its prime factorization. Since 24 = A013929(8), a(8) = 1.
		

References

  • M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 844.

Crossrefs

Programs

Formula

a(n) = A056170(A013929(n)).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = (Sum_{p prime} 1/p^2)/(1-1/zeta(2)) = A085548 / A229099 = 1.15347789194214704903... . - Amiram Eldar, Oct 01 2023