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.

A343574 a(n) = Sum_{d|n} d^d * binomial(d+n/d-1, d).

Original entry on oeis.org

1, 6, 30, 272, 3130, 46794, 823550, 16778544, 387420768, 10000018820, 285311670622, 8916100779324, 302875106592266, 11112006832146486, 437893890380925960, 18446744073860555680, 827240261886336764194, 39346408075300413088392
Offset: 1

Views

Author

Seiichi Manyama, Apr 20 2021

Keywords

Crossrefs

Programs

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

Formula

G.f.: Sum_{k >= 1} (k * x)^k/(1 - x^k)^(k+1).
If p is prime, a(p) = p + p^p.