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 A157100 #13 Jul 13 2022 17:57:53
%S A157100 1,2,3,6,14,37,105,312,956,2996,9554,30897,101083,333947,1112497,
%T A157100 3732956,12605030,42800318,146046820,500555448,1722402304,5948047170,
%U A157100 20607691518,71610355541,249520257107,871614139397,3051737703527
%N A157100 Transform of Catalan numbers whose Hankel transform satisfies the Somos-4 recurrence.
%C A157100 Hankel transform is A157101.
%C A157100 The ratio of this generating function by the generating function of A025262 is x*(1-x), which means this sequence is the partial sums of A025262. - _Sean A. Irvine_, _R. J. Mathar_, Jun 27 2022
%H A157100 G. C. Greubel, <a href="/A157100/b157100.txt">Table of n, a(n) for n = 0..1000</a>
%F A157100 G.f.: (1+x)*c(x*(1-x^2)), c(x) the g.f. of A000108;
%F A157100 a(n) = Sum_{k=0..n} (-1)^binomial(n-k,2)*binomial(k,floor((n-k)/2))*A000108(k).
%F A157100 Conjecture: (n+1)*a(n) +(-5*n+1)*a(n-1) +2*(2*n-1)*a(n-2) +2*(2*n-7)*a(n-3) +2*(-2*n+7)*a(n-4) = 0. - _R. J. Mathar_, Feb 05 2015
%t A157100 a[n_]:= Sum[(-1)^Binomial[k, 2]*Binomial[n-k, Floor[k/2]]*CatalanNumber[n-k], {k,0,n}];
%t A157100 Table[a[n], {n, 0, 40}] (* _G. C. Greubel_, Jan 11 2022 *)
%o A157100 (Sage)
%o A157100 def A157100(n): return sum((-1)^binomial(k,2)*binomial(n-k, k//2)*catalan_number(n-k) for k in (0..n))
%o A157100 [A157100(n) for n in (0..40)] # _G. C. Greubel_, Jan 11 2022
%Y A157100 Cf. A000108, A157101.
%Y A157100 Partial sums of A025262.
%K A157100 easy,nonn
%O A157100 0,2
%A A157100 _Paul Barry_, Feb 22 2009