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.

A349303 G.f. A(x) satisfies: A(x) = 1 / ((1 + x) * (1 - x * A(x)^7)).

Original entry on oeis.org

1, 0, 1, 7, 57, 483, 4257, 38675, 359969, 3416329, 32943289, 321888455, 3180249409, 31718822793, 318934721393, 3229639622847, 32907617157641, 337144842511850, 3470986886039193, 35890957497118363, 372584381500477185, 3881595191885835547
Offset: 0

Views

Author

Ilya Gutkovskiy, Nov 13 2021

Keywords

Comments

In general, for k>=1, Sum_{j=0..n} (-1)^(n-k) * binomial(n + (k-1)*j,k*j) * binomial((k+1)*j,j) / (k*j+1) ~ sqrt(1 - (k-1)*r) / (sqrt(2*k*(k+1)*(1+r)*Pi) * (k+1)^(1/k) * n^(3/2) * r^(n + 1/k)), where r is the smallest real root of the equation (k+1)^(k+1) * r = k^k * (1+r)^k. - Vaclav Kotesovec, Nov 14 2021

Crossrefs

Programs

  • Mathematica
    nmax = 21; A[] = 0; Do[A[x] = 1/((1 + x) (1 - x A[x]^7)) + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]
    Table[Sum[(-1)^(n - k) Binomial[n + 6 k, 7 k] Binomial[8 k, k]/(7 k + 1), {k, 0, n}], {n, 0, 21}]

Formula

a(n) = Sum_{k=0..n} (-1)^(n-k) * binomial(n+6*k,7*k) * binomial(8*k,k) / (7*k+1).
a(n) ~ sqrt(1 - 6*r) / (2^(17/7) * sqrt(7*Pi*(1+r)) * n^(3/2) * r^(n + 1/7)), where r = 0.08937121041965233233945479666512758370169477786851479485467... is the real root of the equation 8^8 * r = 7^7 * (1+r)^7. - Vaclav Kotesovec, Nov 14 2021
From Peter Bala, Jun 02 2024: (Start)
A(x) = 1/(1 + x)*F(x/(1 + x)^7), where F(x) = Sum_{n >= 0} A007556(n)*x^n.
A(x) = 1/(1 + x) + x*A(x)^8. (End)