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-2 of 2 results.

A356661 a(n) = n! * Sum_{d|n} 1/d^(n/d - 1).

Original entry on oeis.org

1, 4, 12, 60, 240, 1860, 10080, 95760, 766080, 8210160, 79833600, 1100484000, 12454041600, 188172784800, 2683799838720, 44951306400000, 711374856192000, 13745322470880000, 243290200817664000, 5142812718440517120, 103294640229580800000, 2351280996859354560000
Offset: 1

Views

Author

Seiichi Manyama, Aug 21 2022

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := n! * DivisorSum[n, 1/#^(n/# - 1) &]; Array[a, 22] (* Amiram Eldar, Aug 21 2022 *)
  • PARI
    a(n) = n!*sumdiv(n, d, 1/d^(n/d-1));
    
  • PARI
    my(N=30, x='x+O('x^N)); Vec(serlaplace(sum(k=1, N, x^k/(1-x^k/k))))

Formula

a(p) = 2 * p! for prime p.
E.g.f.: Sum_{k>=1} x^k/(1 - x^k/k).

A351165 a(n) = n! * Sum_{d|n} d^(d - n/d).

Original entry on oeis.org

1, 6, 60, 1584, 75120, 5601960, 592956000, 84557864160, 15620794842240, 3628800457682400, 1035338990353113600, 355902198996315787200, 145077660657865961625600, 69194697633957032681544000, 38174841090323471644830720000, 24122334398251368151021076928000
Offset: 1

Views

Author

Seiichi Manyama, Aug 21 2022

Keywords

Crossrefs

Programs

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

Formula

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