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.

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

This page as a plain text file.
%I A349047 #11 Nov 07 2021 11:17:57
%S A349047 1,1,1,0,-2,-5,-7,-4,10,38,70,68,-40,-329,-767,-1012,-214,2842,8642,
%T A349047 14332,10136,-21622,-96578,-196412,-213080,96264,1037344,2608788,
%U A349047 3698996,1121127,-10234567,-33425980,-58537486,-45735382,83471346,408899204,871127040
%N A349047 G.f. A(x) satisfies: A(x) = 1 / (1 - x + x^3 * A(x)).
%H A349047 Seiichi Manyama, <a href="/A349047/b349047.txt">Table of n, a(n) for n = 0..1000</a>
%F A349047 G.f.: (-1 + x + sqrt((1 - x)^2 + 4*x^3)) / (2*x^3).
%F A349047 a(0) = 1; a(n) = a(n-1) - Sum_{k=0..n-3} a(k) * a(n-k-3).
%F A349047 a(n) = Sum_{k=0..floor(n/3)} (-1)^k * binomial(n-k,2*k) * Catalan(k).
%F A349047 a(n) = F([(1-n)/3, (2-n)/3, -n/3], [2, -n], -27), where F is the generalized hypergeometric function. - _Stefano Spezia_, Nov 07 2021
%t A349047 nmax = 36; A[_] = 0; Do[A[x_] = 1/(1 - x + x^3 A[x]) + O[x]^(nmax + 1) // Normal,nmax + 1]; CoefficientList[A[x], x]
%t A349047 a[0] = 1; a[n_] := a[n] = a[n - 1] - Sum[a[k] a[n - k - 3], {k, 0, n - 3}]; Table[a[n], {n, 0, 36}]
%t A349047 Table[Sum[(-1)^k Binomial[n - k, 2 k] CatalanNumber[k], {k, 0, Floor[n/3]}], {n, 0, 36}]
%Y A349047 Cf. A000108, A007440, A023431, A100223, A214649, A343773, A349048.
%K A349047 sign
%O A349047 0,5
%A A349047 _Ilya Gutkovskiy_, Nov 06 2021