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.

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

Original entry on oeis.org

1, 0, 6, 51, 578, 7011, 89931, 1198798, 16445122, 230643888, 3292247673, 47672499727, 698569117499, 10339672571689, 154357100458366, 2321475460350492, 35140713973159266, 534971413383669580, 8185501429052369700, 125811555778930237392, 1941590759206061655069
Offset: 0

Views

Author

Ilya Gutkovskiy, Jul 27 2021

Keywords

Comments

Inverse binomial transform of A002296.

Crossrefs

Programs

  • Mathematica
    Table[Sum[(-1)^(n - k) Binomial[n, k] Binomial[7 k, k]/(6 k + 1), {k, 0, n}], {n, 0, 20}]
    nmax = 20; A[] = 0; Do[A[x] = 1/(1 + x) + x (1 + x)^5 A[x]^7 + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]
    nmax = 20; CoefficientList[Series[Sum[(Binomial[7 k, k]/(6 k + 1)) x^k/(1 + x)^(k + 1), {k, 0, nmax}], {x, 0, nmax}], x]
    Table[(-1)^n HypergeometricPFQ[{1/7, 2/7, 3/7, 4/7, 5/7, 6/7, -n}, {1/3, 1/2, 2/3, 5/6, 1, 7/6}, 823543/46656], {n, 0, 20}]
  • PARI
    a(n) = sum(k=0, n, (-1)^(n-k)*binomial(n,k)*binomial(7*k,k)/(6*k + 1)); \\ Michel Marcus, Jul 28 2021

Formula

G.f. A(x) satisfies: A(x) = 1 / (1 + x) + x * (1 + x)^5 * A(x)^7.
G.f.: Sum_{k>=0} ( binomial(7*k,k) / (6*k + 1) ) * x^k / (1 + x)^(k+1).
a(n) ~ 776887^(n + 3/2) / (282475249 * sqrt(Pi) * n^(3/2) * 2^(6*n + 2) * 3^(6*n + 3/2)). - Vaclav Kotesovec, Jul 30 2021