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!)
A345090 a(n) = Sum_{k=1..n} k^floor(1/gcd(k,2*n-k)). 1
1, 2, 3, 6, 7, 10, 13, 20, 19, 26, 31, 32, 43, 50, 43, 72, 73, 66, 91, 92, 81, 122, 133, 112, 139, 170, 139, 184, 211, 142, 241, 272, 193, 290, 239, 240, 343, 362, 267, 344, 421, 282, 463, 464, 305, 530, 553, 416, 541, 530, 451, 652, 703, 522, 595, 704, 561, 842, 871, 524, 931 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
EXAMPLE
a(4) = Sum_{k=1..4} k^floor(1/gcd(k,2*4-k)) = 1^floor(1/gcd(1,7)) + 2^floor(1/gcd(2,6)) + 3^floor(1/gcd(3,5)) + 4^floor(1/gcd(4,4)) = 1^1 + 2^0 + 3^1 + 4^0 = 1 + 1 + 3 + 1 = 6.
MATHEMATICA
Table[Sum[k^Floor[1/GCD[k, 2 n - k]], {k, n}], {n, 80}]
CROSSREFS
Cf. A345091.
Sequence in context: A293392 A161336 A266536 * A059096 A257678 A351554
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Jun 07 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 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)