login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A343114 a(n) = Sum_{i=1..n} gcd(n^i,i). 2
1, 3, 5, 8, 9, 17, 13, 20, 21, 35, 21, 50, 25, 49, 51, 48, 33, 91, 37, 88, 77, 89, 45, 126, 65, 107, 81, 124, 57, 255, 61, 112, 141, 163, 137, 242, 73, 177, 167, 232, 81, 365, 85, 220, 227, 209, 93, 328, 133, 315, 213, 264, 105, 393, 229, 342, 257, 267, 117, 680, 121, 281 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
If p is prime, a(p) = 2*p -1. - Seiichi Manyama, Apr 06 2021
MATHEMATICA
Table[Sum[GCD[n^i, i], {i, n}], {n, 100}]
PROG
(PARI) a(n) = sum(i=1, n, gcd(n^i, i)); \\ Michel Marcus, Apr 05 2021
CROSSREFS
Cf. A018804 (Pillai's function), A342449.
Sequence in context: A018804 A032682 A022769 * A349679 A355761 A306948
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Apr 05 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 10:47 EDT 2024. Contains 371967 sequences. (Running on oeis4.)