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.

A295739 Expansion of e.g.f. exp(Sum_{k>=1} d(k)*x^k/k!), where d(k) is the number of divisors of k (A000005).

Original entry on oeis.org

1, 1, 3, 9, 36, 158, 802, 4434, 26978, 176637, 1243528, 9316519, 74065506, 621187700, 5480130494, 50662481722, 489552042241, 4931215686119, 51668848043427, 561981734692781, 6333882472789914, 73850048237680936, 889461218944314524, 11051067390893340510
Offset: 0

Views

Author

Ilya Gutkovskiy, Nov 26 2017

Keywords

Comments

Exponential transform of A000005.

Crossrefs

Programs

  • Maple
    a:=series(exp(add(tau(k)*x^k/k!,k=1..100)),x=0,24): seq(n!*coeff(a,x,n),n=0..23); # Paolo P. Lava, Mar 27 2019
  • Mathematica
    nmax = 23; CoefficientList[Series[Exp[Sum[DivisorSigma[0, k] x^k/k!, {k, 1, nmax}]], {x, 0, nmax}], x] Range[0, nmax]!
    a[n_] := a[n] = Sum[Binomial[n - 1, k - 1] DivisorSigma[0, k] a[n - k], {k, 1, n}]; a[0] = 1; Table[a[n], {n, 0, 23}]

Formula

E.g.f.: exp(Sum_{k>=1} A000005(k)*x^k/k!).
a(0) = 1; a(n) = Sum_{k=1..n} binomial(n-1,k-1)*A000005(k)*a(n-k).