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.

A346684 a(n) = Sum_{k=0..n} (-1)^(n-k) * binomial(8*k,k) / (7*k + 1).

Original entry on oeis.org

1, 0, 8, 84, 1156, 17122, 268262, 4370086, 73281938, 1256608767, 21933420953, 388400019583, 6960642974905, 126008367913375, 2300862338502425, 42326714610861679, 783717720798538121, 14594469249932149279, 273161824453612674593, 5135931850101477641707
Offset: 0

Views

Author

Ilya Gutkovskiy, Jul 29 2021

Keywords

Comments

In general, for m > 1, Sum_{k=0..n} (-1)^(n-k) * binomial(m*k,k) / ((m-1)*k + 1) ~ m^(m*(n+1) + 1/2) / (sqrt(2*Pi) * (m^m + (m-1)^(m-1)) * n^(3/2) * (m-1)^((m-1)*n + 3/2)). - Vaclav Kotesovec, Jul 30 2021

Crossrefs

Programs

  • Mathematica
    Table[Sum[(-1)^(n - k) Binomial[8 k, k]/(7 k + 1), {k, 0, n}], {n, 0, 19}]
    nmax = 19; A[] = 0; Do[A[x] = 1/(1 + x) + x (1 + x)^7 A[x]^8 + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]
  • PARI
    a(n) = sum(k=0, n, (-1)^(n-k)*binomial(8*k, k)/(7*k + 1)); \\ Michel Marcus, Jul 29 2021

Formula

G.f. A(x) satisfies: A(x) = 1 / (1 + x) + x * (1 + x)^7 * A(x)^8.
a(n) ~ 2^(24*n + 25) / (17600759 * sqrt(Pi) * n^(3/2) * 7^(7*n + 3/2)). - Vaclav Kotesovec, Jul 30 2021