cp's OEIS Frontend

A319692 a(n) = Product_{d|n, d prime(1+A001414(d)), where A001414(d) gives the sum of prime factors of d, with repetition.

%I A319692 #7 Oct 02 2018 17:41:11
%S A319692 1,2,2,10,2,70,2,110,14,130,2,10010,2,190,182,1870,2,15470,2,27170,
%T A319692 266,370,2,3233230,26,430,238,60610,2,5169710,2,43010,518,610,494,
%U A319692 74364290,2,710,602,13394810,2,15543710,2,175010,71162,890,2,2156564410,38,76570,854,250690,2,10318490,962,38123690,994,1130,2,971341981610,2,1310,140182,1333310,1118
%N A319692 a(n) = Product_{d|n, d<n} prime(1+A001414(d)), where A001414(d) gives the sum of prime factors of d, with repetition.
%H A319692 Antti Karttunen, <a href="/A319692/b319692.txt">Table of n, a(n) for n = 1..8192</a>
%F A319692 a(n) = Product_{d|n, d<n} A000040(1+A001414(d)).
%F A319692 For all n >= 1:
%F A319692 A001221(a(n)) = A305611(n).
%o A319692 (PARI)
%o A319692 A001414(n) = ((n=factor(n))[, 1]~*n[, 2]); \\ From A001414.
%o A319692 A319692(n) = { my(m=1); fordiv(n, d, if(d<n, m *= prime(1+A001414(d)))); (m); }; \\ _Antti Karttunen_, Oct 02 2018
%Y A319692 Cf. A001414, A319693 (rgs-transform).
%Y A319692 Cf. also A319352.
%K A319692 nonn
%O A319692 1,2
%A A319692 _Antti Karttunen_, Oct 02 2018