Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #10 Sep 01 2017 03:04:20
%S 1,5,16,45,132,449,1816,8460,43717,244869,1469094,9375888,63337464,
%T 451011317,3372983491,26409145110,215868629023,1837579724641,
%U 16254473067368,149114870667176,1416212525570460,13902957827280263
%N {a(4,n)}, where a(m,n) is as defined in sequence A110576.
%H G. C. Greubel, <a href="/A110580/b110580.txt">Table of n, a(n) for n = 0..570</a>
%t a[0, 0] := 1; a[0, 1] := 1; a[0, n_] := a[0, n] = Sum[Binomial[2*n - k - 3, n - 2]*a[0, k], {k, 0, n - 1}]; a[1, 0] := 1; a[1, n_] := a[1, n] = a[1, n - 1] + a[0, n]; a[2, 0] := 1; a[2, n_] := a[2, n] = a[2, n - 1] + a[1, n]; a[3, 0] := 1; a[3, n_] := a[3, n] = a[3, n - 1] + a[2, n]; a[4, 0] := 1; a[4, n_] := a[4, n] = a[4, n - 1] + a[3, n]; Table[a[4, n], {n, 0, 50}] (* _G. C. Greubel_, Sep 01 2017 *)
%Y Cf. A110576, A110577, A110578, A110579.
%K easy,nonn
%O 0,2
%A _Leroy Quet_, Jul 28 2005
%E More terms from _Ryan Propper_, Sep 25 2005