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.

A385501 Expansion of e.g.f. (1/x) * Series_Reversion( x * exp(-arctanh(x)) ).

Original entry on oeis.org

1, 1, 3, 18, 165, 2040, 31815, 599760, 13268745, 337115520, 9674678475, 309554784000, 10927053262125, 421849524096000, 17682153623909775, 799730490214656000, 38820939579369572625, 2013202580708487168000, 111081054630965602057875, 6497703571257963896832000
Offset: 0

Views

Author

Seiichi Manyama, Jul 01 2025

Keywords

Crossrefs

Cf. A385500, A385502.
Cf. A001147, A111594, A138020, A227466, A385426.

Programs

  • Mathematica
    nmax=20; CoefficientList[(1/x) *InverseSeries[Series[x * Exp[-ArcTanh[x]],{x,0,nmax}],x] ,x]Range[0,nmax-1]! (* Stefano Spezia, Jul 01 2025 *)
  • PARI
    a(n) = n!*sum(k=0, n, binomial(n, k)*binomial(n/2+k+1/2, n)/(n+2*k+1));

Formula

E.g.f. A(x) satisfies A(x) = exp( arctanh(x*A(x)) ).
E.g.f. A(x) satisfies A(x) = sqrt( (1+x*A(x))/(1-x*A(x)) ).
a(n) = Sum_{k=0..n} (n+1)^(k-1) * A111594(n,k).
a(n) = n!/2^n * A138020(n) = n! * Sum_{k=0..n} binomial(n,k) * binomial(n/2+k+1/2,n)/(n+2*k+1).

A385502 E.g.f. A(x) satisfies A(x) = exp( arctanh(x * A(x)) / A(x) ).

Original entry on oeis.org

1, 1, 1, 3, 25, 205, 2001, 25991, 394353, 6718041, 130319745, 2833146987, 67767170505, 1772434086501, 50392083769041, 1546052750636655, 50905035315373281, 1790951445870568113, 67050161599822764417, 2661363261252799648083, 111637709182606749500025
Offset: 0

Views

Author

Seiichi Manyama, Jul 01 2025

Keywords

Crossrefs

Cf. A385500, A385501.
Cf. A111594, A385428.

Programs

  • Mathematica
    terms = 21; A[] = 1; Do[A[x] = Exp[ArcTanh[x*A[x]]/A[x]] + O[x]^terms // Normal, terms]; CoefficientList[A[x], x]Range[0,terms-1]! (* Stefano Spezia, Jul 01 2025 *)
  • PARI
    a111594(n, k) = my(x='x+O('x^(n+1))); n!*polcoef(atanh(x)^k/k!, n);
a(n) = sum(k=0, n, (n-k+1)^(k-1)*a111594(n, k));

Formula

E.g.f. A(x) satisfies A(x) = ( (1+x*A(x))/(1-x*A(x)) )^(1/(2*A(x))).
a(n) = Sum_{k=0..n} (n-k+1)^(k-1) * A111594(n,k).
a(n) ~ s * sqrt((-1 + r^2*s^2)/(1 - 2*r^2*(1 + r)*s^2 + r^4*s^4)) * n^(n-1) / (exp(n) * r^(n - 1/2)), where r = 0.4422573061236400123439455590007131605377062990202... and s = 1.93686591146053883124948614770176661449449740697... are the roots of the system of equations ((1 + r*s)/(1 - r*s))^(1/2/s) = s, 2*r*s + (-1 + r^2*s^2)*(log((1 + r*s)/(1 - r*s)) + 2*s) = 0. - Vaclav Kotesovec, Jul 01 2025
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.