|
%I #16 Sep 06 2019 02:02:26
%S 2,3,4,16,12,60,96,294,720,1936,3920,9680,33712,83248,303408,1517040,
%T 5207472
%N Smallest m such that A001221(A001159(m)) = n.
%C a(18) > 18000000. - _Vaclav Kotesovec_, Sep 06 2019
%F a(n) = Min(x : A001221(A001159(x)) = n) = Min(x; A066102(x) = n).
%t Do[m = 1; While[PrimeNu[DivisorSigma[4, m]] != n, m++]; Print[m], {n, 1, 16}] (* _Vaclav Kotesovec_, Sep 05 2019 *)
%o (PARI) { for (n=1, 100, m=1; while (omega(sigma(m, 4)) != n, m++); write("b066103.txt", n, " ", m) ) } \\ _Harry J. Smith_, Nov 14 2009
%Y Cf. A001159, A001221, A066102.
%K nonn,more
%O 1,1
%A _Labos Elemer_, Dec 04 2001
%E a(13) from _Harry J. Smith_, Nov 14 2009
%E a(14)-a(17) from _Vaclav Kotesovec_, Sep 06 2019
|
