OFFSET
1,2
COMMENTS
Partial sums of A034699.
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
FORMULA
Conjecture: a(n) = O(n^2/log(n)).
EXAMPLE
a(1) = 1;
a(2) = 3 because 2 is a prime and 1 + 2 = 3;
a(3) = 6 because 3 is a prime and 3 + 3 = 6;
a(4) = 10 because 4 = 2^2 and 6 + 4 = 10;
a(5) = 15 because 5 is a prime and 10 + 5 = 15;
a(6) = 18 because 12 = 2*3 and 15 + 3 = 18, etc.
MAPLE
g:= n -> max(map(t -> t[1]^t[2], ifactors(n)[2])): g(1):= 1:
ListTools:-PartialSums(map(g, [$1..100])); # Robert Israel, Mar 29 2017
MATHEMATICA
Accumulate[Join[{1}, Table[Last[Select[Divisors[n], PrimePowerQ[#1] & ]], {n, 2, 65}]]]
PROG
(PARI) a(n) = if (n==1, 1, 1+ sum(k=2, n, f = factor(k); f[#f~, 1]^f[#f~, 2])); \\ Michel Marcus, Mar 28 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Mar 28 2017
STATUS
approved