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.

A212175 List of exponents >= 2 in canonical prime factorization of A025487(n) (first integer of each prime signature), in nonincreasing order, or 0 if no such exponent exists.

Original entry on oeis.org

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

Views

Author

Matthew Vandermast, Jun 03 2012

Keywords

Comments

Length of row n equals A212178(n) if A212178(n) is positive, or 1 if A212178(n) = 0.
Row n of table represents second signature of A025487(n) (cf. A212172). The use of 0 in the table to represent numbers with no exponents >=2 in their prime factorization accords with the usual OEIS practice of using 0 to represent nonexistent elements when possible. In comments, the second signature of squarefree numbers is represented as { }.

Examples

			240 = 2^4*3*5 has 1 exponent in its canonical prime factorization that equals or exceeds 2 (namely, 4). Hence, 240's second signature is {4}. Since 240 = A025487(24), row 24 of the table represents the second signature {4}.
		

Crossrefs

A124832 gives all positive exponents in prime factorization of A025487(n) for n > 1.

Formula

a(n) = A212172(A025487(n)).