cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A359731 a(n) = (1/2) * Sum_{d|n} (2*d)^d.

Original entry on oeis.org

1, 9, 109, 2057, 50001, 1493109, 52706753, 2147485705, 99179645293, 5120000050009, 292159150705665, 18260173719523445, 1240576436601868289, 91029559915023973833, 7174453500000000050109, 604462909807316734838793, 54214017802982966177103873
Offset: 1

Views

Author

Seiichi Manyama, Jan 12 2023

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := DivisorSum[n, (2*#)^# &] / 2; Array[a, 20] (* Amiram Eldar, Aug 14 2023 *)
  • PARI
    a(n) = sumdiv(n, d, (2*d)^d)/2;
    
  • PARI
    my(N=20, x='x+O('x^N)); Vec(sum(k=1, N, 2^(k-1)*(k*x)^k/(1-x^k)))

Formula

G.f.: Sum_{k>0} 2^(k-1) * (k * x)^k / (1 - x^k).
Showing 1-1 of 1 results.