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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A345891 a(n) = n + (n - 1) * phi(n). 1
 1, 3, 7, 10, 21, 16, 43, 36, 57, 46, 111, 56, 157, 92, 127, 136, 273, 120, 343, 172, 261, 232, 507, 208, 505, 326, 495, 352, 813, 262, 931, 528, 673, 562, 851, 456, 1333, 704, 951, 664, 1641, 534, 1807, 904, 1101, 1036, 2163, 800, 2065, 1030, 1651, 1276, 2757, 1008, 2215, 1376 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS For 1 <= k <= n, add n if gcd(n,k) = 1, otherwise add 1. For n = 9 there are 6 numbers less than or equal to 9 that are relatively prime to 9 and 3 that are not. So a(9) = 9*6 + 3*1 = 57. LINKS Table of n, a(n) for n=1..56. FORMULA a(n) = Sum_{k=1..n} n^floor(1/gcd(n,k)). a(n) = A062955(n) + n. - Michel Marcus, Jun 28 2021 MATHEMATICA Table[n + (n - 1)*EulerPhi[n], {n, 50}] PROG (PARI) a(n) = n + (n-1)*eulerphi(n); \\ Michel Marcus, Jun 28 2021 CROSSREFS Cf. A000010 (phi), A062955, A345892. Sequence in context: A031328 A255180 A053159 * A279912 A305477 A316306 Adjacent sequences: A345888 A345889 A345890 * A345892 A345893 A345894 KEYWORD nonn AUTHOR Wesley Ivan Hurt, Jun 28 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.

Last modified August 14 18:55 EDT 2024. Contains 375166 sequences. (Running on oeis4.)