|
%I #13 Nov 21 2021 07:34:04
%S 1,1,1,1,1,1,1,1,1,1,1,1,3,1,1,1,2,1,6,1,1,1,3,1,1,3,1,1,11,1,2,1,1,2,
%T 1,1,4,6,3,1,3,1,19,1,1,3,1,1,1,1,2,3,25,1,1,1,6,11,3,1,29,2,1,1,3,1,
%U 1,2,3,1,10,1,7,4,1,6,1,3,11,1,1,3,2,1,2,19,11,1,14,1,3,3,2,1,6,1,1,1,1,1,4,2,11,3,1,25,57,1,2,1,4,1,60,6,3,11,3,3,2,1
%N a(n) = A065371(A065371(n)).
%H Antti Karttunen, <a href="/A065372/b065372.txt">Table of n, a(n) for n = 1..10000</a>
%t b[n_] := b[n] = If[n == 1, 1, If[PrimeQ[n], n - PrimePi[n], Product[{p, e} = pe; b[p]^e, {pe, FactorInteger[n]}]]];
%t a[n_] := b[b[n]];
%t Array[a, 120] (* _Jean-François Alcover_, Nov 21 2021 *)
%o (Scheme) (define (A065372 n) (A065371 (A065371 n))) ;; _Antti Karttunen_, Jan 12 2017
%o (PARI) b(n) = my(f=factor(n)); for (k=1, #f~, f[k, 1]-=primepi(f[k, 1])); factorback(f); \\ A065371
%o a(n) = b(b(n)); \\ _Michel Marcus_, Nov 21 2021
%Y Cf. A065371, A065373, A065374.
%K mult,nonn
%O 1,13
%A _Reinhard Zumkeller_, Nov 01 2001
%E Data section extended to 120 terms by _Antti Karttunen_, Jan 12 2017
|
