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!)
A342629 a(n) = Sum_{d|n} (n/d)^(n-d). 8
1, 3, 10, 69, 626, 7866, 117650, 2101265, 43047451, 1000390658, 25937424602, 743069105634, 23298085122482, 793728614541474, 29192926269590300, 1152925902670135553, 48661191875666868482, 2185913413229070900339, 104127350297911241532842 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
G.f.: Sum_{k>=1} k^(k-1) * x^k/(1 - k^(k-1) * x^k).
If p is prime, a(p) = 1 + p^(p-1).
MATHEMATICA
a[n_] := DivisorSum[n, (n/#)^(n - #) &]; Array[a, 20] (* Amiram Eldar, Mar 17 2021 *)
PROG
(PARI) a(n) = sumdiv(n, d, (n/d)^(n-d));
(PARI) my(N=20, x='x+O('x^N)); Vec(sum(k=1, N, k^(k-1)*x^k/(1-k^(k-1)*x^k)))
(Python)
from sympy import divisors
def A342629(n): return sum((n//d)**(n-d) for d in divisors(n, generator=True)) # Chai Wah Wu, Jun 19 2022
CROSSREFS
Sequence in context: A080526 A359701 A308814 * A232213 A143083 A002499
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Mar 16 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 08:33 EDT 2024. Contains 371905 sequences. (Running on oeis4.)