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!)
A359796 a(n) = Sum_{d|n} (2*d)^(d-1). 2

%I #12 Aug 14 2023 02:00:29

%S 1,5,37,517,10001,248873,7529537,268435973,11019960613,512000010005,

%T 26559922791425,1521681143418409,95428956661682177,

%U 6502111422505477189,478296900000000010037,37778931862957430145541,3189059870763703892770817

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

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

%t a[n_] := DivisorSum[n, (2*#)^(# - 1) &]; Array[a, 20] (* _Amiram Eldar_, Aug 14 2023 *)

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

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

%Y Cf. A262843, A359731.

%K nonn,easy

%O 1,2

%A _Seiichi Manyama_, Jan 13 2023

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 May 11 17:45 EDT 2024. Contains 372410 sequences. (Running on oeis4.)