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 A010739 #25 Jul 24 2022 16:40:07
%S A010739 1,2,1,1,-2,3,-7,22,-71,231,-794,2945,-11679,48770,-212823,969221,
%T A010739 -4605674,22802431,-117322423,625743878,-3452893503,19684083947,
%U A010739 -115787084242,701935339725,-4380330298815,28105726916034,-185229395693615,1252696143653513
%N A010739 Shifts 2 places left under inverse binomial transform.
%H A010739 Alois P. Heinz, <a href="/A010739/b010739.txt">Table of n, a(n) for n = 0..650</a>
%H A010739 M. Bernstein and N. J. A. Sloane, <a href="https://arxiv.org/abs/math/0205301">Some canonical sequences of integers</a>, arXiv:math/0205301 [math.CO], 2002; Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to arXiv version]
%H A010739 M. Bernstein and N. J. A. Sloane, <a href="/A003633/a003633_1.pdf">Some canonical sequences of integers</a>, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to Lin. Alg. Applic. version together with omitted figures]
%H A010739 N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>
%F A010739 G.f. A(x) satisfies: A(x) = 1 + 2*x + x^2*A(x/(1 + x))/(1 + x). - _Ilya Gutkovskiy_, Feb 02 2022
%p A010739 a:= proc(n) option remember; (m-> `if`(m<0, 2^n,
%p A010739 add(a(m-j)*binomial(m, j)*(-1)^j, j=0..m)))(n-2)
%p A010739 end:
%p A010739 seq(a(n), n=0..35); # _Alois P. Heinz_, Feb 02 2022
%t A010739 a[n_] := a[n] = Function[m, If[m<0, 2^n,
%t A010739 Sum[a[m-j]*Binomial[m, j]*(-1)^j, {j, 0, m}]]][n-2];
%t A010739 Table[a[n], {n, 0, 35}] (* _Jean-François Alcover_, Jul 24 2022, after _Alois P. Heinz_ *)
%Y A010739 Cf. A010741, A010743, A010745, A010747.
%K A010739 sign,eigen
%O A010739 0,2
%A A010739 _N. J. A. Sloane_, _Jonas Wallgren_