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.

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

Original entry on oeis.org

1, 4, 27, 257, 3125, 46665, 823543, 16777312, 387420490, 10000001250, 285311670611, 8916100467712, 302875106592253, 11112006825910963, 437893890380859625, 18446744073716891649, 827240261886336764177, 39346408075296709766628, 1978419655660313589123979
Offset: 1

Views

Author

Seiichi Manyama, Apr 24 2021

Keywords

Crossrefs

Programs

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

Formula

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