login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A212178
Number of exponents >= 2 in canonical prime factorization of A025487(n) (first integer of each prime signature).
2
0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 0, 2, 1, 1, 2, 2, 1, 1, 2, 1, 1, 2, 2, 1, 1, 2, 3, 1, 1, 2, 2, 2, 2, 2, 1, 1, 2, 3, 1, 1, 2, 2, 0, 2, 2, 2, 1, 1, 2, 3, 1, 1, 2, 2, 1, 2, 2, 3, 2, 1, 3, 2, 1, 2, 3, 2, 1, 2, 1, 2, 2, 1, 2, 2, 3, 2, 1
OFFSET
1,11
COMMENTS
Length of row n of A212175 equals a(n) if a(n) is positive, 1 otherwise.
FORMULA
a(n) = A056170(A025487(n)).
EXAMPLE
The canonical prime factorization of 24 (2^3*3) has 1 exponent that equals or exceeds 2. Since 24 = A025487(8), a(8) = 1.
CROSSREFS
Sequence in context: A161098 A354999 A136177 * A322818 A362611 A374470
KEYWORD
nonn
AUTHOR
Matthew Vandermast, Jun 04 2012
STATUS
approved