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.

A318811 Expansion of e.g.f. exp(Sum_{k>=1} phi(k)*x^k), where phi is the Euler totient function A000010.

Original entry on oeis.org

1, 1, 3, 19, 121, 1161, 9931, 124363, 1542129, 21594961, 335083411, 5712781251, 104044684393, 2036445474649, 42781075481691, 943820382272251, 22433542236603361, 556276331238284193, 14612462927067954979, 401110580118493111411, 11553483337639043003481
Offset: 0

Views

Author

Vaclav Kotesovec, Sep 04 2018

Keywords

Crossrefs

Programs

  • Mathematica
    nmax = 25; CoefficientList[Series[Exp[Sum[EulerPhi[k]*x^k, {k, 1, nmax}]], {x, 0, nmax}], x] * Range[0, nmax]!
  • PARI
    my(N=40, x='x+O('x^N)); Vec(serlaplace(exp(sum(k=1, N, eulerphi(k)*x^k)))) \\ Seiichi Manyama, Apr 07 2022
    
  • PARI
    a(n) = if(n==0, 1, (n-1)!*sum(k=1, n, k*eulerphi(k)*a(n-k)/(n-k)!)); \\ Seiichi Manyama, Apr 07 2022

Formula

a(n) ~ 2^(1/3) * exp(1/6 + 3^(4/3) * n^(2/3) / (2^(1/3) * Pi^(2/3)) - n) * n^(n - 1/6) / (3*Pi)^(1/3).
a(0) = 1; a(n) = (n-1)! * Sum_{k=1..n} k * phi(k) * a(n-k)/(n-k)!. - Seiichi Manyama, Apr 07 2022