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.

A292589 a(n) = A046523(A003557(n)) = A003557(A046523(n)); the least representative of the prime signature of {n divided by largest squarefree divisor of n}.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 1, 4, 2, 1, 1, 2, 1, 1, 1, 8, 1, 2, 1, 2, 1, 1, 1, 4, 2, 1, 4, 2, 1, 1, 1, 16, 1, 1, 1, 6, 1, 1, 1, 4, 1, 1, 1, 2, 2, 1, 1, 8, 2, 2, 1, 2, 1, 4, 1, 4, 1, 1, 1, 2, 1, 1, 2, 32, 1, 1, 1, 2, 1, 1, 1, 12, 1, 1, 2, 2, 1, 1, 1, 8, 8, 1, 1, 2, 1, 1, 1, 4, 1, 2, 1, 2, 1, 1, 1, 16, 1, 2, 2, 6, 1, 1, 1, 4, 1
Offset: 1

Views

Author

Antti Karttunen, Sep 27 2017

Keywords

Examples

			For n = 18 = 2 * 3^2, A003557(18) = 3^1. The least representative of the same prime signature is 2^1, thus a(18) = 2.
For n = 27 = 3^3, A003557(27) = 9 = 3^2. The least representative of the same prime signature is 2^2, thus a(27) = 4.
		

Crossrefs

Differs from A162510 for the first time at n=36 where a(36) = 6, while A162510(36) = 4.

Formula

a(n) = A046523(A003557(n)) = A003557(A046523(n)).