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

A349253 G.f. A(x) satisfies A(x) = 1 / ((1 - x) * (1 - 2 * x * A(x)^2)).

Original entry on oeis.org

1, 3, 19, 169, 1753, 19795, 236035, 2923857, 37256881, 485202307, 6429346899, 86405569657, 1174917167881, 16134949855251, 223460304878467, 3117521211476641, 43771643214792033, 618045740600046211, 8770377489446217235, 125013010654218317385, 1789104455068153153849
Offset: 0

Views

Author

Ilya Gutkovskiy, Nov 12 2021

Keywords

Crossrefs

Programs

  • Mathematica
    nmax = 20; A[] = 0; Do[A[x] = 1/((1 - x) (1 - 2 x A[x]^2)) + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]
    a[n_] := a[n] = 1 + 2 Sum[Sum[a[i] a[j] a[n - i - j - 1], {j, 0, n - i - 1}], {i, 0, n - 1}]; Table[a[n], {n, 0, 20}]
    Table[Sum[Binomial[n + k, n - k] 2^k Binomial[3 k, k]/(2 k + 1), {k, 0, n}], {n, 0, 20}]
    a[n_] := HypergeometricPFQ[{1/3,2/3,-n,n + 1}, {1/2,1,3/2}, -(3/2)^3];
    Table[a[n], {n, 0, 20}] (* Peter Luschny, Nov 12 2021 *)

Formula

a(n) = 1 + 2 * Sum_{i=0..n-1} Sum_{j=0..n-i-1} a(i) * a(j) * a(n-i-j-1).
a(n) = Sum_{k=0..n} binomial(n+k,n-k) * 2^k * binomial(3*k,k) / (2*k+1).
a(n) = hypergeom([1/3, 2/3, -n, n + 1], [1/2, 1, 3/2], -(3/2)^3). - Peter Luschny, Nov 12 2021
a(n) ~ sqrt(315 + 31*sqrt(105)) * (31 + 3*sqrt(105))^n / (9 * sqrt(Pi) * 2^(2*n + 5/2) * n^(3/2)). - Vaclav Kotesovec, Nov 13 2021

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

Original entry on oeis.org

1, 1, 7, 47, 369, 3113, 27631, 254239, 2403361, 23201393, 227771831, 2266983119, 22822484497, 231994748633, 2377894546783, 24548520253247, 255026759000897, 2664111200687969, 27967731861910759, 294900120348032623, 3121862973452544433, 33167268461833410569
Offset: 0

Views

Author

Ilya Gutkovskiy, Nov 12 2021

Keywords

Crossrefs

Programs

  • Mathematica
    nmax = 21; A[] = 0; Do[A[x] = 1/((1 + x) (1 - 2 x A[x]^2)) + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]
    a[n_] := a[n] = (-1)^n + 2 Sum[Sum[a[i] a[j] a[n - i - j - 1], {j, 0, n - i - 1}], {i, 0, n - 1}]; Table[a[n], {n, 0, 21}]
    Table[Sum[(-1)^(n - k) Binomial[n + k, n - k] 2^k Binomial[3 k, k]/(2 k + 1), {k, 0, n}], {n, 0, 21}]
    a[n_] := (-1)^n*HypergeometricPFQ[{1/3, 2/3, -n, n + 1}, {1/2, 1, 3/2}, (3/2)^3]; Table[a[n], {n, 0, 21}] (* Peter Luschny, Nov 12 2021 *)

Formula

a(n) = (-1)^n + 2 * Sum_{i=0..n-1} Sum_{j=0..n-i-1} a(i) * a(j) * a(n-i-j-1).
a(n) = Sum_{k=0..n} (-1)^(n-k) * binomial(n+k,n-k) * 2^k * binomial(3*k,k) / (2*k+1).
a(n) = (-1)^n*hypergeom([1/3, 2/3, -n, n + 1], [1/2, 1, 3/2], (3/2)^3). - Peter Luschny, Nov 12 2021
a(n) ~ sqrt(171 + 23*sqrt(57)) * (23 + 3*sqrt(57))^n / (9 * sqrt(Pi) * n^(3/2) * 2^(2*n + 5/2)). - Vaclav Kotesovec, Nov 13 2021

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

Original entry on oeis.org

1, 2, 19, 206, 2563, 34415, 486370, 7128488, 107364421, 1651615568, 25840137724, 409898503763, 6577319627506, 106571487893024, 1741193467526782, 28653852176675324, 474521786894159593, 7902112425718228064, 132243695376774536755, 2222925664652778182060
Offset: 0

Views

Author

Ilya Gutkovskiy, Nov 12 2021

Keywords

Crossrefs

Programs

  • Mathematica
    nmax = 19; A[] = 0; Do[A[x] = 1/((1 + x) (1 - 3 x A[x]^2)) + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]
    a[n_] := a[n] = (-1)^n + 3 Sum[Sum[a[i] a[j] a[n - i - j - 1], {j, 0, n - i - 1}], {i, 0, n - 1}]; Table[a[n], {n, 0, 19}]
    Table[Sum[(-1)^(n - k) Binomial[n + k, n - k] 3^k Binomial[3 k, k]/(2 k + 1), {k, 0, n}], {n, 0, 19}]
    a[n_] := (-1)^n*HypergeometricPFQ[{1/3, 2/3, -n, n + 1}, {1/2, 1, 3/2}, (3/2)^4]; Table[a[n], {n, 0, 19}] (* Peter Luschny, Nov 12 2021 *)

Formula

a(n) = (-1)^n + 3 * Sum_{i=0..n-1} Sum_{j=0..n-i-1} a(i) * a(j) * a(n-i-j-1).
a(n) = Sum_{k=0..n} (-1)^(n-k) * binomial(n+k,n-k) * 3^k * binomial(3*k,k) / (2*k+1).
a(n) = (-1)^n*hypergeom([1/3, 2/3, -n, n + 1], [1/2, 1, 3/2], (3/2)^4). - Peter Luschny, Nov 12 2021
a(n) ~ sqrt(585 + 73*sqrt(65)) * (73 + 9*sqrt(65))^n / (3^(5/2) * sqrt(Pi) * n^(3/2) * 2^(3*n + 5/2)). - Vaclav Kotesovec, Nov 13 2021

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

Original entry on oeis.org

1, 4, 21, 138, 1063, 9075, 82770, 789204, 7766721, 78267306, 803447526, 8371413999, 88300495746, 941004684748, 10116276976218, 109578418285452, 1194764348642313, 13102287157827918, 144422108994233625, 1599198859915070640, 17780781456147340764
Offset: 0

Views

Author

Ilya Gutkovskiy, Nov 21 2021

Keywords

Crossrefs

Programs

  • Mathematica
    nmax = 20; A[] = 0; Do[A[x] = 1/((1 - 3 x) (1 - x A[x]^2)) + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]
    a[n_] := a[n] = 3^n + Sum[Sum[a[i] a[j] a[n - i - j - 1], {j, 0, n - i - 1}], {i, 0, n - 1}]; Table[a[n], {n, 0, 20}]
    Table[Sum[Binomial[n + k, 2 k] Binomial[3 k, k] 3^(n - k)/(2 k + 1), {k, 0, n}], {n, 0, 20}]

Formula

a(n) = 3^n + Sum_{i=0..n-1} Sum_{j=0..n-i-1} a(i) * a(j) * a(n-i-j-1).
a(n) = Sum_{k=0..n} binomial(n+k,2*k) * binomial(3*k,k) * 3^(n-k) / (2*k+1).
a(n) = 3^n*F([1/3, 2/3, -n, 1+n], [1/2, 1, 3/2], -3^2/2^4), where F is the generalized hypergeometric function. - Stefano Spezia, Nov 21 2021
a(n) ~ sqrt(5/Pi) * 3^(n-1) * 4^n / n^(3/2). - Vaclav Kotesovec, Nov 22 2021

A364645 G.f. satisfies A(x) = 1/(1 - 3*x) - x*A(x)^3.

Original entry on oeis.org

1, 2, 3, 6, 19, 51, 114, 312, 981, 2616, 6564, 19647, 59922, 159056, 430302, 1329996, 3926217, 10498968, 30052851, 93244764, 267690168, 729649143, 2173840338, 6663260223, 18768583674, 52570016676, 160362713250, 481809941520, 1346473504182, 3886164785178
Offset: 0

Views

Author

Seiichi Manyama, Jul 31 2023

Keywords

Crossrefs

Programs

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

Formula

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