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.

A369208 Expansion of (1/x) * Series_Reversion( x * (1-x)^2 / (1+x^2) ).

This page as a plain text file.
%I A369208 #24 Feb 15 2024 04:19:16
%S A369208 1,2,8,38,200,1122,6576,39790,246672,1558658,10001592,64997814,
%T A369208 426922392,2829624514,18901301984,127115260894,859978039840,
%U A369208 5848754717314,39964745880552,274231943135686,1888891689752680,13055393137141282,90517646431869328
%N A369208 Expansion of (1/x) * Series_Reversion( x * (1-x)^2 / (1+x^2) ).
%H A369208 P. Bala, <a href="/A251592/a251592.pdf">Fractional iteration of a series inversion operator</a>
%H A369208 <a href="/index/Res#revert">Index entries for reversions of series</a>
%F A369208 a(n) = (1/(n+1)) * Sum_{k=0..floor(n/2)} binomial(n+1,k) * binomial(3*n-2*k+1,n-2*k).
%F A369208 a(n) = (1/(n+1)) *[x^n] ( 1/(1-x)^2 * (1+x^2) )^(n+1). - _Seiichi Manyama_, Feb 14 2024
%o A369208 (PARI) my(N=30, x='x+O('x^N)); Vec(serreverse(x*(1-x)^2/(1+x^2))/x)
%o A369208 (PARI) a(n, s=2, t=1, u=2) = sum(k=0, n\s, binomial(t*(n+1), k)*binomial((u+1)*(n+1)-s*k-2, n-s*k))/(n+1);
%Y A369208 Cf. A218045, A369263.
%Y A369208 Cf. A052709, A109081.
%Y A369208 Cf. A370242.
%K A369208 nonn
%O A369208 0,2
%A A369208 _Seiichi Manyama_, Jan 18 2024