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!)
A342628 a(n) = Sum_{d|n} d^(n-d). 15

%I #22 Jun 19 2022 15:23:09

%S 1,2,2,6,2,45,2,322,731,3383,2,132901,2,827641,10297068,33570818,2,

%T 2578617270,2,44812807567,678610493340,285312719189,2,393061010002613,

%U 95367431640627,302875123369471,150094917726535604,569939345952661545,2,105474306078445349841,2

%N a(n) = Sum_{d|n} d^(n-d).

%H Seiichi Manyama, <a href="/A342628/b342628.txt">Table of n, a(n) for n = 1..599</a>

%F G.f.: Sum_{k>=1} x^k/(1 - (k * x)^k).

%F If p is prime, a(p) = 2.

%t a[n_] := DivisorSum[n, #^(n - #) &]; Array[a, 30] (* _Amiram Eldar_, Mar 17 2021 *)

%o (PARI) a(n) = sumdiv(n, d, d^(n-d));

%o (PARI) my(N=40, x='x+O('x^N)); Vec(sum(k=1, N, x^k/(1-(k*x)^k)))

%o (Python)

%o from sympy import divisors

%o def A342628(n): return sum(d**(n-d) for d in divisors(n,generator=True)) # _Chai Wah Wu_, Jun 19 2022

%Y Cf. A023887, A062796, A308594, A342629.

%K nonn

%O 1,2

%A _Seiichi Manyama_, Mar 16 2021

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.)