OFFSET
1,1
LINKS
Chai Wah Wu, Table of n, a(n) for n = 1..38
EXAMPLE
a(2) = 8 because the integer log of 8! = 2^7 * 3^2 * 5 * 7 is 2*7 + 3*2 + 5 + 7 = 32 = 2^5 is a perfect power.
MAPLE
spf:= proc(n) local t; add(t[1]*t[2], t=ifactors(n)[2]) end proc:ispow:= proc(n) igcd(map(t -> t[2], ifactors(n)[2]))>1 end proc:s:= 0: R:= NULL: count:= 0:
for i from 1 while count < 27 do
s:= s+spf(i);
if ispow(s) then
count:= count+1; R:= R, i;
fi
od:
R;
MATHEMATICA
Select[Range[8000], GCD @@ FactorInteger[Plus @@ Times @@@ FactorInteger[#!]][[;; , 2]] > 1 &] (* Amiram Eldar, Aug 26 2022 *)
PROG
(Python)
from itertools import count, islice, accumulate
from math import prod
from sympy import perfect_power, factorint
def A356646_gen(): # generator of terms
return (a+2 for a, b in enumerate(accumulate(sum(prod(d) for d in factorint(n).items()) for n in count(2))) if perfect_power(b))
CROSSREFS
KEYWORD
nonn
AUTHOR
J. M. Bergot and Robert Israel, Aug 19 2022
EXTENSIONS
a(28)-a(33) from Chai Wah Wu, Aug 28 2022
STATUS
approved