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.

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

This page as a plain text file.
%I A363816 #28 Oct 20 2023 06:45:01
%S A363816 1,3,2,8,-9,62,-230,1054,-4753,22208,-105419,508396,-2482284,12248430,
%T A363816 -60980860,305955372,-1545397447,7852100312,-40105277621,205798130624,
%U A363816 -1060467961487,5485199090834,-28469067353663,148220323891484,-773892318396664,4051261817405034
%N A363816 G.f. satisfies A(x) = (1 + x/A(x))/(1 - x)^2.
%H A363816 Paolo Xausa, <a href="/A363816/b363816.txt">Table of n, a(n) for n = 0..1000</a>
%F A363816 G.f.: A(x) = -2*x / (1-sqrt(1+4*x*(1-x)^2)).
%F A363816 a(n) = (-1)^(n-1) * Sum_{k=0..n} binomial(2*k-1,k) * binomial(2*(k-1),n-k)/(2*k-1).
%t A363816 A363816[n_]:=(-1)^(n-1)Sum[Binomial[2k-1,k]Binomial[2(k-1),n-k]/(2k-1),{k,0,n}];Array[A363816,30,0] (* _Paolo Xausa_, Oct 20 2023 *)
%o A363816 (PARI) a(n) = (-1)^(n-1)*sum(k=0, n, binomial(2*k-1, k)*binomial(2*(k-1), n-k)/(2*k-1));
%Y A363816 Partial sums of A366356.
%Y A363816 Cf. A162477, A363818, A364629, A364630.
%Y A363816 Cf. A363817, A366363.
%K A363816 sign
%O A363816 0,2
%A A363816 _Seiichi Manyama_, Oct 18 2023