|
%I #15 Apr 10 2021 16:38:19
%S 2,3,2,6,4,9,3,12,8,6,6,18,2,18,3,24,4,12,4,12,4,9,6,36,18,27,6,36,12,
%T 54,6,48,6,6,8,24,6,18,24,24,12,6,9,18,12,36,2,72,18,27,12,54,4,81,12,
%U 72,12,18,8,108,12,9,12,96,9,36,4,12,18,36,8,48,16,27,24,36,9,36,12,48,72,18,6,12,24,54,27,36,24,18,16,72,8,81,2
%N a(n) = A006047(A048673(n)).
%H Antti Karttunen, <a href="/A286586/b286586.txt">Table of n, a(n) for n = 1..8192</a>
%F a(n) = A006047(A048673(n)).
%F For n >= 0, a(A000079(n)) = A042950(n).
%o (Scheme) (define (A286586 n) (A006047 (A048673 n)))
%o (Python)
%o from sympy.ntheory.factor_ import digits
%o from sympy import factorint, nextprime
%o from operator import mul
%o from functools import reduce
%o def a006047(n):
%o d=digits(n, 3)
%o return n + 1 if n<3 else reduce(mul, [1 + d[i] for i in range(1, len(d))])
%o def a048673(n):
%o f = factorint(n)
%o return 1 if n==1 else (1 + reduce(mul, [nextprime(i)**f[i] for i in f]))//2
%o def a(n): return a006047(a048673(n))
%o print([a(n) for n in range(1, 101)]) # _Indranil Ghosh_, Jun 12 2017
%Y Cf. A000079, A006047, A042950, A048673, A286585, A286587.
%K nonn
%O 1,1
%A _Antti Karttunen_, May 31 2017
|
