OFFSET
1,3
COMMENTS
Equivalently: replace each prime power p^e in the prime factorization of n by its index in A246655. - M. F. Hasler, Jun 16 2021
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
FORMULA
MAPLE
N:= 1000: # for a(1)..a(N)
R:= NULL: p:= 2:
while p < N do
R:= R, seq(p^k, k=1..ilog[p](N));
p:= nextprime(p);
od:
L:= sort([R]):
f:= proc(n) local F, t;
F:= ifactors(n)[2];
mul(ListTools:-BinarySearch(L, t[1]^t[2]), t=F)
end proc:
map(f, [$1..N]); # Robert Israel, Feb 11 2021
MATHEMATICA
PrimePowerPi[n_] := Sum[Boole[PrimePowerQ[k]], {k, 1, n}]; a[1] = 1; a[n_] := Times @@ (PrimePowerPi[#[[1]]^#[[2]]] & /@ FactorInteger[n]); Table[a[n], {n, 1, 70}]
PROG
(PARI) apply( {A333235(n)=vecprod([A322981(f[1]^f[2])|f<-factor(n)~])}, [1..99]) \\ M. F. Hasler, Jun 16 2021
CROSSREFS
KEYWORD
AUTHOR
Ilya Gutkovskiy, Mar 12 2020
STATUS
approved