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 #6 Jun 23 2013 10:45:02
%S 1,3,10,30,89,259,748,2148,6150,17578,50204,143364,409500,1170300,
%T 3346944,9579840,27444681,78698475,225887010,648985414,1866356437,
%U 5372348487,15478733108,44637360700,128837626255,372183158061,1076041247778
%N a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is a nonnegative integer, s(0) = 0, s(1) = 1, s(n) = 3, |s(i) - s(i-1)| <= 1 for i >= 2. Also a(n) = T(n,n-3), where T is the array defined in A026105.
%F G.f.: z(1-z)M^4, with M the g.f. of the Motzkin numbers (A001006).
%F Conjecture: (n+5)*a(n) +5*(-n-3)*a(n-1) +4*n*a(n-2) +8*n*a(n-3) +(-5*n+19)*a(n-4) +3*(-n+5)*a(n-5)=0. - _R. J. Mathar_, Jun 23 2013
%Y First differences of A005323. Cf. A026124.
%K nonn
%O 3,2
%A _Clark Kimberling_