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.

A351563 a(n) is the exponent of the second smallest prime factor of n, or 0 if n is a power of a prime.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 2, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 2, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 2, 1, 1, 0, 3, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 2, 0, 1, 2, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 2, 1, 1, 1, 1, 1, 1, 0, 2, 1, 2, 0, 1, 0, 1, 1, 1, 0, 3
Offset: 1

Views

Author

Antti Karttunen, Apr 01 2022

Keywords

Examples

			For n = 4 = 2^2 there is no second smallest prime factor as 4 is a power of prime, therefore a(4) = 0.
For n = 18 = 2^1 * 3^2, the exponent of the second smallest prime factor (3) is 2, therefore a(18) = 2.
		

Crossrefs

Cf. A000961 (positions of zeros), A001221, A028234, A067029.
Cf. also A119288, A351567.

Programs

  • Mathematica
    Array[If[Length[#] < 2, 0, #[[2, -1]]] &@ FactorInteger[#] &, 108] (* Michael De Vlieger, Apr 01 2022 *)
  • PARI
    A351563(n) = if(1>=omega(n), 0, (factor(n))[2,2]);

Formula

a(n) = A067029(A028234(n)).