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-3 of 3 results.

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

Original entry on oeis.org

1, 1, 4, 18, 94, 529, 3135, 19270, 121732, 785496, 5155167, 34304706, 230923653, 1569684910, 10759159000, 74281473504, 516089542684, 3605685460750, 25316226436086, 178538289189108, 1264131169628799, 8982889404251721, 64041351551534215
Offset: 0

Views

Author

Seiichi Manyama, Jul 26 2023

Keywords

Crossrefs

Column k=1 of A378323.
Cf. A002293, A104979, A186997, A255673, A361245, A364474, A364478.

Programs

  • Maple
    A364475 := proc(n)
    add( binomial(3*n-3*k,k) * binomial(3*n-4*k,n-2*k)/(2*n-2*k+1),k=0..n/2) ;
end proc:
seq(A364475(n),n=0..80); # R. J. Mathar, Jul 27 2023
  • PARI
    a(n) = sum(k=0, n\2, binomial(3*n-3*k, k)*binomial(3*n-4*k, n-2*k)/(2*n-2*k+1));

Formula

a(n) = Sum_{k=0..floor(n/2)} binomial(3*n-3*k,k) * binomial(3*n-4*k,n-2*k) / (2*n-2*k+1).
D-finite with recurrence 2*n*(2*n+1)*a(n) -(5*n+1)*(3*n-2)*a(n-1) +4*(-25*n^2+75*n-59) *a(n-2) +9*(-15*n^2+69*n-80)*a(n-3) -6*(3*n-8)*(3*n-10) *a(n-4)=0. - R. J. Mathar, Jul 27 2023

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

Original entry on oeis.org

1, 1, 4, 16, 77, 403, 2228, 12800, 75653, 457022, 2809266, 17514200, 110480475, 703850686, 4522217364, 29268545416, 190645760149, 1248817411471, 8221323983431, 54365667330636, 360954069730636, 2405225494066647, 16080210766344354, 107828663888705292
Offset: 0

Views

Author

Seiichi Manyama, Jul 26 2023

Keywords

Links

Crossrefs

Cf. A002293, A104979, A186997, A255673, A361245, A364475, A364478.

Programs

  • Maple
    A364474 := proc(n)
    add( binomial(3*n-5*k,k) * binomial(3*n-6*k,n-2*k)/(2*n-4*k+1),k=0..n/2) ;
end proc:
seq(A364474(n),n=0..80); # R. J. Mathar, Jul 27 2023
  • Mathematica
    Table[Sum[Binomial[3*n - 5*k, k]*Binomial[3*n - 6*k, n - 2*k]/(2*n - 4*k + 1), {k, 0, Floor[n/2]}], {n, 0, 25}] (* Wesley Ivan Hurt, May 25 2024 *)
  • PARI
    a(n) = sum(k=0, n\2, binomial(3*n-5*k, k)*binomial(3*n-6*k, n-2*k)/(2*n-4*k+1));

Formula

a(n) = Sum_{k=0..floor(n/2)} binomial(3*n-5*k,k) * binomial(3*n-6*k,n-2*k) / (2*n-4*k+1).
D-finite with recurrence 2*n*(2*n+1)*(3*n-7)*a(n) -3*(3*n-1)*(3*n-7)*(3*n-2) *a(n-1) -2*(n-3)*(18*n^2-33*n+4) *a(n-2) +2*(18*n^3-141*n^2+287*n-64) *a(n-4) -2*(n-4)*(3*n-1)*(2*n-13)*a(n-6)=0. - R. J. Mathar, Jul 27 2023

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

Original entry on oeis.org

1, 1, 4, 15, 70, 360, 1953, 11008, 63837, 378390, 2282205, 13960890, 86411232, 540166219, 3405341160, 21625820793, 138216775785, 888371346825, 5738510504979, 37234351046835, 242567430368298, 1585979835198675, 10403866383915844, 68453912880893025
Offset: 0

Views

Author

Seiichi Manyama, Nov 03 2023

Keywords

Crossrefs

Cf. A176697, A367041.
Cf. A366266, A366676.
Cf. A002293, A104979, A186997, A255673, A361245, A364474, A364475, A364478.

Programs

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

Formula

a(n) = Sum_{k=0..floor(n/2)} binomial(2*(n-2*k)+1,k) * binomial(3*(n-2*k),n-2*k)/(2*(n-2*k)+1).
Showing 1-3 of 3 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.