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 A007469 M1498 #30 Jan 25 2020 17:59:03
%S A007469 1,1,1,2,5,16,66,343,2167,16193,140919,1414947,16258868,211935996,
%T A007469 3105828560,50748310068,918138961643,18287966027343,399145502051200,
%U A007469 9505803743367971,246064556796896554,6897674469134480653,208651954748397405264,6788671409470892058148
%N A007469 Shifts left 2 places under Stirling2 transform.
%D A007469 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A007469 Alois P. Heinz, <a href="/A007469/b007469.txt">Table of n, a(n) for n = 1..150</a>
%H A007469 M. Bernstein and N. J. A. Sloane, <a href="http://arXiv.org/abs/math.CO/0205301">Some canonical sequences of integers</a>, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to arXiv version]
%H A007469 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 A007469 N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>
%p A007469 stirtr:= proc(p)
%p A007469 proc(n) add(p(k)*Stirling2(n, k), k=0..n) end
%p A007469 end:
%p A007469 a:= proc(n) option remember; `if`(n<3, 1, aa(n-2)) end:
%p A007469 aa:= stirtr(a):
%p A007469 seq(a(n), n=1..25); # _Alois P. Heinz_, Jun 22 2012
%t A007469 stirtr[p_] := Function[{n}, Sum[p[k]*StirlingS2[n, k], {k, 0, n}]]; a[n_] := a[n] = If[n<3, 1, aa[n-2]]; aa = stirtr[a]; Table[a[n], {n, 1, 24}] (* _Jean-François Alcover_, Jan 09 2013, translated from _Alois P. Heinz_'s Maple program *)
%K A007469 nonn,nice,eigen
%O A007469 1,4
%A A007469 _N. J. A. Sloane_