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 A119649 #4 Mar 30 2012 16:50:26
%S A119649 0,1,3,12,114,1404,22968,456408,10762992,292851648,9038285280,
%T A119649 311858347968,11896746473088,497156854363776,22586083785232128,
%U A119649 1108320770197398528,58420751739908940288,3292054745517600648192,197491129333671926863872,12566253138627465234487296
%N A119649 a(0)=0, a(1)=1; for n >= 1, a(n+1) = (n+2)*a(n) + 2*Sum_{k=2..n-1} binomial(n, k)*a(k)*a(n-k+1).
%C A119649 The recurrence for A000311, with slightly different initial conditions.
%H A119649 T. D. Noe, <a href="/A119649/b119649.txt">Table of n, a(n) for n = 0..100</a>
%p A119649 M:=50; a:=array(0..100); a[0]:=0; a[1]:=1; lprint(0,a[0]); lprint(1,a[1]); for n from 1 to M do a[n+1]:=(n+2)*a[n]+2*add(binomial(n,k)*a[k]*a[n-k+1],k=2..n-1); lprint(n+1,a[n+1]); od:
%Y A119649 Cf. A000311.
%K A119649 nonn
%O A119649 0,3
%A A119649 _N. J. A. Sloane_, Jul 30 2006