cp's OEIS Frontend

A026086 Number of (s(0), s(1), ..., s(n)) such that s(0) = 0, |s(i) - s(i-1)| = 1 for i = 1,2,3; |s(i) - s(i-1)| <= 1 for i >= 4, s(n) = 3; also a(n) = T(n,n-3), where T is the array defined in A026082.

%I A026086 #6 Jun 23 2013 10:22:33
%S A026086 1,6,16,52,156,475,1429,4293,12853,38413,114621,341639,1017407,
%T A026086 3027909,9007017,26783331,79622595,236662764,703350798,2090179494,
%U A026086 6211285598,18457764317,54851312871,163009822939,484469104651,1439956255806
%N A026086 Number of (s(0), s(1), ..., s(n)) such that s(0) = 0, |s(i) - s(i-1)| = 1 for i = 1,2,3; |s(i) - s(i-1)| <= 1 for i >= 4, s(n) = 3; also a(n) = T(n,n-3), where T is the array defined in A026082.
%F A026086 Conjecture: (n+3)*a(n) +5*(-n-1)*a(n-1) +3*(n-5)*a(n-2) +(11*n-9)*a(n-3) +4*(-n+11)*a(n-4) +6*(-n+7)*a(n-5)=0. - _R. J. Mathar_, Jun 23 2013
%Y A026086 First differences of A026070.
%K A026086 nonn
%O A026086 4,2
%A A026086 _Clark Kimberling_