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.

A366240 G.f. A(x) satisfies A(x) = 1 + x + x*(1 + x)^3*A(x)^3.

Original entry on oeis.org

1, 2, 9, 60, 432, 3378, 27792, 237122, 2079132, 18620709, 169614960, 1566540573, 14635978998, 138080055192, 1313596636812, 12587218990644, 121378106852988, 1176981533610012, 11469587139406515, 112265849283068877, 1103256200355696855
Offset: 0

Views

Author

Seiichi Manyama, Oct 05 2023

Keywords

Crossrefs

Programs

  • PARI
    a(n) = sum(k=0, n, binomial(5*k+1, n-k)*binomial(3*k, k)/(2*k+1));

Formula

a(n) = Sum_{k=0..n} binomial(5*k+1,n-k) * binomial(3*k,k)/(2*k+1).

A366241 G.f. A(x) satisfies A(x) = 1 + x + x*(1 + x)^4*A(x)^3.

Original entry on oeis.org

1, 2, 10, 72, 552, 4593, 40185, 364413, 3395217, 32305005, 312589540, 3066565720, 30430287693, 304907935707, 3080617021926, 31349533179726, 321038696185371, 3305935381202847, 34211612434972446, 355605873560512974, 3710978684625678870
Offset: 0

Views

Author

Seiichi Manyama, Oct 05 2023

Keywords

Crossrefs

Programs

  • PARI
    a(n) = sum(k=0, n, binomial(6*k+1, n-k)*binomial(3*k, k)/(2*k+1));

Formula

a(n) = Sum_{k=0..n} binomial(6*k+1,n-k) * binomial(3*k,k)/(2*k+1).
Showing 1-2 of 2 results.