|
%I #18 Nov 08 2018 21:13:25
%S 0,1,1,2,1,2,1,3,2,2,1,2,1,2,2,4,1,2,1,2,2,2,1,2,2,2,3,2,1,3,1,5,2,2,
%T 2,2,1,2,2,2,1,3,1,2,2,2,1,2,2,2,2,2,1,2,2,2,2,2,1,2,1,2,2,6,2,3,1,2,
%U 2,3,1,2,1,2,2,2,2,3,1,2,4,2,1,2,2,2,2,2,1,2,2,2,2,2,2,2,1,2,2,2,1,3,1,2,3
%N If n is prime, set a(n) = 1. Otherwise, start with the multiset of prime factors of n, and given a multiset take the multiset of its multiplicities. Repeating this until a multiset of size 1 is reached, set a(n) to the unique element of this multiset.
%C a(1) = 0 by convention.
%C a(n) depends only on prime signature of n (cf. A025487). - _Antti Karttunen_, Nov 08 2018
%H Antti Karttunen, <a href="/A304465/b304465.txt">Table of n, a(n) for n = 1..16384</a>
%H Antti Karttunen, <a href="/A304465/a304465.txt">Data supplement: n, a(n) computed for n = 1..100000</a>
%H <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a>
%F a(p^n) = n where p is any prime number.
%F a(product of n distinct primes) = n.
%F a(1) = 0; and for n > 1, if n = prime^k, a(n) = k, otherwise, if n is squarefree [i.e., A001221(n) = A001222(n)], a(n) = A001221(n), otherwise a(n) = a(A181819(n)). - _Antti Karttunen_, Nov 08 2018
%e Starting with the multiset of prime factors of 2520 we have {2,2,2,3,3,5,7} -> {1,1,2,3} -> {1,1,2} -> {1,2} -> {1,1} -> {2}, so a(2520) = 2.
%t Table[Switch[n,1,0,_?PrimeQ,1,_,NestWhile[Sort[Length/@Split[#]]&,Sort[Last/@FactorInteger[n]],Length[#]>1&]//First],{n,100}]
%o (PARI)
%o A181819(n) = factorback(apply(e->prime(e),(factor(n)[,2])));
%o A304465(n) = if(1==n,0,my(t=isprimepower(n)); if(t,t, t=omega(n); if(bigomega(n)==t),t,A304465(A181819(n)))); \\ _Antti Karttunen_, Nov 08 2018
%Y Cf. A000005, A001222, A001597, A005117, A007916, A055932, A056239, A112798, A181819, A182850, A182857, A275870, A296150, A303945, A304464.
%K nonn
%O 1,4
%A _Gus Wiseman_, May 13 2018
%E More terms from _Antti Karttunen_, Nov 08 2018
|
