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 #8 Jul 08 2022 10:53:10
%S 1,4,10,28,76,209,575,1589,4405,12253,34189,95679,268503,755457,
%T 2130717,6023235,17063139,48434514,137741280,392407134,1119766942,
%U 3200326627,9160055809,26254474379,75348899051,216515177336,622887159274
%N a(n) = number of (s(0),s(1),...,s(n)) such that every s(i) is a nonnegative integer, s(0) = 1, s(n) = 2, |s(1) - s(0)| = 1, |s(i) - s(i-1)| <= 1 for i >= 2. Also a(n) = T(n,n-1), where T is the array in A026120; a(n) = U(n,n+1), where U is the array in A026148.
%F G.f.: z^2(-1+(1-z)^2M^3), with M the g.f. of the Motzkin numbers (A001006).
%F D-finite with recurrence: (n+5)*a(n) +5*(-n-3)*a(n-1) +(5*n+1)*a(n-2) +(5*n+3)*a(n-3) +6*(-n+3)*a(n-4)=0. - _R. J. Mathar_, Jun 23 2013
%Y First differences of A026134.
%K nonn
%O 2,2
%A _Clark Kimberling_