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.
%I A363182 #8 May 21 2023 00:44:04
%S A363182 1,2,6,20,68,234,824,2956,10750,39540,146864,550096,2075432,7880046,
%T A363182 30086704,115445028,444941028,1721720032,6686357238,26051961396,
%U A363182 101810056296,398962013908,1567354966200,6171824148252,24355381522328,96304034538898,381506619687824
%N A363182 Expansion of g.f. A(x) satisfying 2 = Sum_{n=-oo..+oo} (-1)^n * x^n * (2*A(x) + x^(2*n-1))^(n+1).
%H A363182 Paul D. Hanna, <a href="/A363182/b363182.txt">Table of n, a(n) for n = 0..300</a>
%F A363182 G.f. A(x) = Sum_{n>=0} a(n)*x^n satisfies the following.
%F A363182 (1) 2 = Sum_{n=-oo..+oo} (-1)^n * x^n * (2*A(x) + x^(2*n-1))^(n+1).
%F A363182 (2) 2*x = Sum_{n=-oo..+oo} (-1)^n * x^(2*n*(n-1)) / (1 + 2*A(x)*x^(2*n+1))^(n-1).
%F A363182 (3) A(x) = 1 / Sum_{n=-oo..+oo} (-1)^n * x^n * (2*A(x) + x^(2*n-1))^n.
%F A363182 (4) A(x) = x / Sum_{n=-oo..+oo} (-1)^n * x^(3*n) * (2*A(x) + x^(2*n-1))^(n-1).
%F A363182 (5) A(x) = 1 / Sum_{n=-oo..+oo} (-1)^n * x^(2*n^2) / (1 + 2*A(x)*x^(2*n+1))^n.
%F A363182 a(n) = Sum_{k=0..floor(n/2)} A359670(n-k,n-2*k) * 2^(n-2*k) for n >= 0.
%e A363182 G.f.: A(x) = 1 + 2*x + 6*x^2 + 20*x^3 + 68*x^4 + 234*x^5 + 824*x^6 + 2956*x^7 + 10750*x^8 + 39540*x^9 + 146864*x^10 + ...
%o A363182 (PARI) {a(n) = my(A=[1]); for(i=1, n, A = concat(A, 0);
%o A363182 A[#A] = polcoeff(1 - sum(m=-#A, #A, (-1)^m * x^m * (2*Ser(A) + x^(2*m-1))^(m+1) ), #A-1)/2); A[n+1]}
%o A363182 for(n=0, 30, print1(a(n), ", "))
%Y A363182 Cf. A363142, A363183, A363184, A363185.
%Y A363182 Cf. A359670.
%K A363182 nonn
%O A363182 0,2
%A A363182 _Paul D. Hanna_, May 20 2023