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

A219534 G.f. satisfies A(x) = 1 + x*(A(x)^2 + A(x)^4).

Original entry on oeis.org

1, 2, 12, 100, 968, 10208, 113792, 1318832, 15732064, 191878592, 2381917824, 29995598208, 382257383168, 4920505410816, 63882881030656, 835554927932160, 10999486798112256, 145626782310460416, 1937772463214168064, 25901381584638605312, 347618773649248088064
Offset: 0

Views

Author

Paul D. Hanna, Nov 21 2012

Keywords

Examples

			G.f.: A(x) = 1 + 2*x + 12*x^2 + 100*x^3 + 968*x^4 + 10208*x^5 +...
Related expansions:
A(x)^2 = 1 + 4*x + 28*x^2 + 248*x^3 + 2480*x^4 + 26688*x^5 +...
A(x)^4 = 1 + 8*x + 72*x^2 + 720*x^3 + 7728*x^4 + 87104*x^5 +...
The g.f. satisfies A(x) = G(x*A(x)^2) and G(x) = A(x/G(x)^2) where
G(x) = 1 + 2*x + 4*x^2 + 12*x^3 + 40*x^4 + 144*x^5 + 544*x^6 +...+ A025227(n+1)*x^n +...

Links

Crossrefs

Cf. A025227, A219535, A219536, A219537, A219538.
Cf. A006318, A364167.

Programs

  • Mathematica
    nmax=20; aa=ConstantArray[0,nmax]; aa[[1]]=2; Do[AGF=1+Sum[aa[[n]]*x^n,{n,1,j-1}]+koef*x^j; sol=Solve[Coefficient[1+x*(AGF^2+AGF^4)-AGF,x,j]==0,koef][[1]];aa[[j]]=koef/.sol[[1]],{j,2,nmax}]; Flatten[{1,aa}] (* Vaclav Kotesovec, Sep 10 2013 *)
  • PARI
    /* Formula A(x) = 1 + x*(A(x)^2 + A(x)^4): */
{a(n)=local(A=1);for(i=1,n,A=1+x*(A^2+A^4) +x*O(x^n));polcoeff(A,n)}
for(n=0,25,print1(a(n),", "))
  • PARI
    /* Formula using Series Reversion: */
{a(n)=local(A=1,G=(1-sqrt(1-4*x-4*x^2+x^3*O(x^n)))/(2*x));A=sqrt((1/x)*serreverse(x/G^2));polcoeff(A,n)}
for(n=0,25,print1(a(n),", "))

Formula

Let G(x) = (1 - sqrt(1-4*x-4*x^2))/(2*x), then g.f. A(x) satisfies:
(1) A(x) = sqrt( (1/x)*Series_Reversion(x/G(x)^2) ),
(2) A(x) = G(x*A(x)^2) and G(x) = A(x/G(x)^2),
where x*G(x) is the g.f. of A025227.
Recurrence: 3*n*(3*n-1)*(3*n+1)*(131*n^3 - 666*n^2 + 1075*n - 558)*a(n) = 2*(26200*n^6 - 172500*n^5 + 431572*n^4 - 521613*n^3 + 316327*n^2 - 89058*n + 8640)*a(n-1) - 12*(n-2)*(1441*n^5 - 8767*n^4 + 19186*n^3 - 18172*n^2 + 6930*n - 810)*a(n-2) + 8*(n-3)*(n-2)*(2*n-5)*(131*n^3 - 273*n^2 + 136*n - 18)*a(n-3). - Vaclav Kotesovec, Sep 10 2013
a(n) ~ c*d^n/n^(3/2), where d = 2/81*(7217783 + 10611 * sqrt(786))^(1/3) + 74654/(81*(7217783 + 10611 * sqrt(786))^(1/3)) + 400/81 = 14.48001092254652246... is the root of the equation -16 + 132*d - 400*d^2 + 27*d^3 = 0 and c = 1/2358*sqrt(262)*sqrt((213070976 + 3034746 * sqrt(786))^(1/3) * ((213070976 + 3034746 * sqrt(786))^(2/3) + 336670 + 1310*(213070976 + 3034746 * sqrt(786))^(1/3)))/((213070976 + 3034746 * sqrt(786))^(1/3)*sqrt(Pi)) = 0.1929450901182412149... - Vaclav Kotesovec, Sep 10 2013
a(n) = (1/n) * Sum_{k=0..floor(n-1)/2} 2^(n-k) * binomial(n,k) * binomial(3*n-k,n-1-2*k) for n > 0. - Seiichi Manyama, Apr 01 2024
a(n) = Sum_{k=0..n} binomial(n,k) * binomial(2*n+2*k+1,n)/(2*n+2*k+1). - Seiichi Manyama, Apr 03 2024

A378240 Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,0) = 0^n and T(n,k) = k * Sum_{r=0..n} binomial(n,r) * binomial(3*n+3*r+k,n)/(3*n+3*r+k) for k > 0.

Original entry on oeis.org

1, 1, 0, 1, 2, 0, 1, 4, 18, 0, 1, 6, 40, 234, 0, 1, 8, 66, 540, 3570, 0, 1, 10, 96, 926, 8400, 59586, 0, 1, 12, 130, 1400, 14706, 141876, 1053570, 0, 1, 14, 168, 1970, 22720, 251622, 2528760, 19392490, 0, 1, 16, 210, 2644, 32690, 394152, 4524786, 46815116, 367677090, 0
Offset: 0

Views

Author

Seiichi Manyama, Nov 20 2024

Keywords

Examples

			Square array begins:
  1,       1,       1,       1,       1,        1,        1, ...
  0,       2,       4,       6,       8,       10,       12, ...
  0,      18,      40,      66,      96,      130,      168, ...
  0,     234,     540,     926,    1400,     1970,     2644, ...
  0,    3570,    8400,   14706,   22720,    32690,    44880, ...
  0,   59586,  141876,  251622,  394152,   575402,   801948, ...
  0, 1053570, 2528760, 4524786, 7156128, 10553970, 14867704, ...

Crossrefs

Columns k=0..1 give A000007, A364167.
Cf. A033877, A071949, A378236, A378237, A378238, A378239.

Programs

  • PARI
    T(n, k, t=3, u=3) = if(k==0, 0^n, k*sum(r=0, n, binomial(n, r)*binomial(t*n+u*r+k, n)/(t*n+u*r+k)));
matrix(7, 7, n, k, T(n-1, k-1))

Formula

G.f. A_k(x) of column k satisfies A_k(x) = ( 1 + x * A_k(x)^(3/k) * (1 + A_k(x)^(3/k)) )^k for k > 0.
G.f. of column k: B(x)^k where B(x) is the g.f. of A364167.
B(x)^k = B(x)^(k-1) + x * B(x)^(k+2) + x * B(x)^(k+5). So T(n,k) = T(n,k-1) + T(n-1,k+2) + T(n-1,k+5) for n > 0.

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

Original entry on oeis.org

1, 6, 66, 926, 14706, 251622, 4524786, 84310014, 1613384994, 31521329670, 626151135330, 12608193099294, 256769542135314, 5279533270393446, 109449833201392530, 2285215031994672894, 48011502768234360642, 1014265693597636966662
Offset: 0

Views

Author

Seiichi Manyama, Apr 02 2024

Keywords

Crossrefs

Cf. A006318, A371693.
Cf. A364167.

Programs

  • PARI
    a(n, r=3, t=3, u=3) = r*sum(k=0, n, binomial(n, k)*binomial(t*n+u*k+r, n)/(t*n+u*k+r));

Formula

G.f.: B(x)^3 where B(x) is the g.f. of A364167.
a(n) = Sum_{k=0..n} binomial(n,k) * binomial(3*n+3*k+3,n)/(n+k+1).

A379244 G.f. A(x) satisfies A(x) = ( (1 + x*A(x)^3)/(1 - x*A(x)) )^2.

Original entry on oeis.org

1, 4, 40, 540, 8400, 141876, 2528760, 46815116, 891483808, 17350187364, 343578992328, 6900588813564, 140230648164720, 2878066866407316, 59571280942854808, 1242093725341221996, 26064579113472078144, 550041399791036747460, 11665771061882347813224, 248527169321049466503132
Offset: 0

Views

Author

Seiichi Manyama, Dec 18 2024

Keywords

Crossrefs

Cf. A032349, A371675.
Cf. A364167, A379174.

Programs

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

Formula

G.f.: B(x)^2 where B(x) is the g.f. of A364167.
a(n) = Sum_{k=0..n} binomial(2*n+4*k+2,k) * binomial(3*n+3*k+1,n-k)/(n+2*k+1).
Showing 1-4 of 4 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.