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

A336289 a(0) = 1; a(n) = n! * Sum_{k=1..n} binomial(n-1,k-1) * (k-1)! * H(k) * a(n-k) / (n-k)!, where H(k) is the k-th harmonic number.

Original entry on oeis.org

1, 1, 5, 55, 1054, 31046, 1299386, 73211510, 5338080280, 488727800664, 54865512897432, 7408400404206792, 1184230737883333680, 221121985937352261360, 47683177920267470877648, 11758982455716373002624816, 3287966057434181416523799936
Offset: 0

Views

Author

Ilya Gutkovskiy, Jul 16 2020

Keywords

Crossrefs

Programs

  • Mathematica
    a[0] = 1; a[n_] := a[n] = n! Sum[Binomial[n - 1, k - 1] (k - 1)! HarmonicNumber[k] a[n - k]/(n - k)!, {k, 1, n}]; Table[a[n], {n, 0, 16}]
    nmax = 16; CoefficientList[Series[Exp[Sum[HarmonicNumber[k] x^k/k, {k, 1, nmax}]], {x, 0, nmax}], x] Range[0, nmax]!^2
    nmax = 16; CoefficientList[Series[Exp[Log[1 - x]^2/2 + PolyLog[2, x]], {x, 0, nmax}], x] Range[0, nmax]!^2

Formula

Sum_{n>=0} a(n) * x^n / (n!)^2 = exp(Sum_{n>=1} H(n) * x^n / n).
Sum_{n>=0} a(n) * x^n / (n!)^2 = exp(log(1 - x)^2 / 2 + polylog(2,x)).
Showing 1-1 of 1 results.