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.

A346627 G.f. A(x) satisfies: A(x) = 1 / (1 + x) + x * A(x)^3.

This page as a plain text file.
%I A346627 #13 Nov 17 2021 07:40:58
%S A346627 1,0,1,2,7,23,82,300,1129,4334,16914,66899,267586,1080516,4398850,
%T A346627 18035084,74402361,308624282,1286428765,5385578256,22635057148,
%U A346627 95471113565,403983783772,1714494024947,7295949019114,31124885587680,133085594104222,570266646942488
%N A346627 G.f. A(x) satisfies: A(x) = 1 / (1 + x) + x * A(x)^3.
%C A346627 Inverse binomial transform of A200753.
%H A346627 Seiichi Manyama, <a href="/A346627/b346627.txt">Table of n, a(n) for n = 0..1000</a>
%F A346627 G.f.: Sum_{k>=0} ( binomial(3*k,k) / (2*k + 1) ) * x^k / (1 + x)^(2*k+1).
%F A346627 a(n) = (-1)^n + Sum_{i=0..n-1} Sum_{j=0..n-i-1} a(i) * a(j) * a(n-i-j-1).
%F A346627 a(n) = Sum_{k=0..n} (-1)^(n-k) * binomial(n+k,n-k) * binomial(3*k,k) / (2*k + 1).
%F A346627 a(n) ~ sqrt(198 + 38*sqrt(33)) * (19 + 3*sqrt(33))^n / (9 * sqrt(Pi) * n^(3/2) * 2^(3*n + 3)). - _Vaclav Kotesovec_, Jul 30 2021
%t A346627 nmax = 27; A[_] = 0; Do[A[x_] = 1/(1 + x) + x A[x]^3 + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]
%t A346627 a[n_] := a[n] = (-1)^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, 27}]
%t A346627 Table[Sum[(-1)^(n - k) Binomial[n + k, n - k] Binomial[3 k, k]/(2 k + 1), {k, 0, n}], {n, 0, 27}]
%Y A346627 Cf. A001764, A005043, A199475, A200753, A346628, A349299, A349300, A349301, A349302, A349303.
%K A346627 nonn
%O A346627 0,4
%A A346627 _Ilya Gutkovskiy_, Jul 25 2021