Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #14 Apr 06 2021 09:56:26
%S 1,3,5,8,9,17,13,20,21,35,21,50,25,49,51,48,33,91,37,88,77,89,45,126,
%T 65,107,81,124,57,255,61,112,141,163,137,242,73,177,167,232,81,365,85,
%U 220,227,209,93,328,133,315,213,264,105,393,229,342,257,267,117,680,121,281
%N a(n) = Sum_{i=1..n} gcd(n^i,i).
%H Seiichi Manyama, <a href="/A343114/b343114.txt">Table of n, a(n) for n = 1..1000</a>
%F If p is prime, a(p) = 2*p -1. - _Seiichi Manyama_, Apr 06 2021
%t Table[Sum[GCD[n^i, i], {i, n}], {n, 100}]
%o (PARI) a(n) = sum(i=1, n, gcd(n^i, i)); \\ _Michel Marcus_, Apr 05 2021
%Y Cf. A018804 (Pillai's function), A342449.
%K nonn
%O 1,2
%A _Wesley Ivan Hurt_, Apr 05 2021