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.

A087179 a(n) = (...(((x1^x2)^x3)^x4)^...) where x1,x2,... are the exponents in the prime factorization of n, a(1) = 0.

Original entry on oeis.org

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

Views

Author

Sam Alexander, Oct 19 2003

Keywords

Examples

			a(75) = a((3^1)*(5^2)) = 1^2 = 1.
a(108) = a((2^2)*(3^3)) = 2^3 = 8.
a(300) = a(2^2 * 3^1 * 5^2) = (2^1)^2 = 4. - _Antti Karttunen_, Aug 27 2017
		

Crossrefs

After a(1) = 0 differs from A290109 for the next time at n=300.

Programs

Formula

If A001221(n) <= 1, a(n) = A067029(n) [i.e., when n is a prime power, p^k, a(n) = k], otherwise a(n) = a(A051119(n)) ^ A071178(n). - Antti Karttunen, Aug 27 2017

Extensions

Term a(1) = 0 prepended by Antti Karttunen, Aug 27 2017