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.
%I A292589 #8 Sep 27 2017 09:20:28
%S A292589 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,
%T A292589 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,
%U A292589 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
%N 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}.
%H A292589 Antti Karttunen, <a href="/A292589/b292589.txt">Table of n, a(n) for n = 1..10000</a>
%H A292589 <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a>
%F A292589 a(n) = A046523(A003557(n)) = A003557(A046523(n)).
%e A292589 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.
%e A292589 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.
%Y A292589 Cf. A003557, A046523, A292582.
%Y A292589 Differs from A162510 for the first time at n=36 where a(36) = 6, while A162510(36) = 4.
%K A292589 nonn
%O A292589 1,4
%A A292589 _Antti Karttunen_, Sep 27 2017