[go: up one dir, main page]

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!)
Revision History for A344461 (Underlined text is an addition; strikethrough text is a deletion.)

Showing all changes.
A344461 a(n) = Sum_{d|n} d^gcd(d,n/d).
(history; published version)
#4 by Wesley Ivan Hurt at Wed May 19 23:51:20 EDT 2021
STATUS

proposed

approved

#3 by Wesley Ivan Hurt at Wed May 19 22:30:13 EDT 2021
STATUS

editing

proposed

#2 by Wesley Ivan Hurt at Wed May 19 22:28:47 EDT 2021
NAME

allocated for Wesley Ivan Hurt

a(n) = Sum_{d|n} d^gcd(d,n/d).

DATA

1, 3, 4, 9, 6, 12, 8, 29, 37, 18, 12, 60, 14, 24, 24, 341, 18, 273, 20, 134, 32, 36, 24, 236, 3151, 42, 784, 240, 30, 72, 32, 4645, 48, 54, 48, 48789, 38, 60, 56, 574, 42, 96, 44, 548, 3462, 72, 48, 21740, 823593, 103203, 72, 750, 54, 6888, 72, 1072, 80, 90, 60, 1160

OFFSET

1,2

COMMENTS

If p is prime, a(p) = Sum_{d|p} d^gcd(d,p/d) = 1^1 + p^1 = p + 1.

EXAMPLE

a(8) = Sum_{d|8} d^gcd(d,8/d) = 1^1 + 2^2 + 4^2 + 8^1 = 29.

MATHEMATICA

Table[Sum[k^GCD[k, n/k] (1 - Ceiling[n/k] + Floor[n/k]), {k, n}], {n, 80}]

CROSSREFS

Cf. A055155, A337180.

KEYWORD

allocated

nonn

AUTHOR

Wesley Ivan Hurt, May 19 2021

STATUS

approved

editing

#1 by Wesley Ivan Hurt at Wed May 19 22:28:47 EDT 2021
NAME

allocated for Wesley Ivan Hurt

KEYWORD

allocated

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 August 29 21:13 EDT 2024. Contains 375518 sequences. (Running on oeis4.)