cp's OEIS Frontend

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.

A026329 a(n) = number of (s(0), s(1), ..., s(n)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| <= 1 for i = 1,2,...,n, s(0) = 2, s(n) = 6. Also a(n) = T(n,n-4), where T is the array in A026323.

This page as a plain text file.
%I A026329 #6 Jun 23 2013 11:39:01
%S A026329 1,5,21,77,266,882,2849,9031,28236,87360,268086,817362,2479008,
%T A026329 7486528,22529250,67598086,202325585,604317021,1801836652,5364359966,
%U A026329 15950297370,47375004170,140581490790,416834841150,1235113792185,3657632434701
%N A026329 a(n) = number of (s(0), s(1), ..., s(n)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| <= 1 for i = 1,2,...,n, s(0) = 2, s(n) = 6. Also a(n) = T(n,n-4), where T is the array in A026323.
%F A026329 Conjecture: -(n+10)*(n-4)*a(n) +3*(2*n+15)*(n-4)*a(n-1) +3*(-3*n^2-n+68)*a(n-2) -4*(n+4)*(n-1)*a(n-3) +12*(n-1)*(n-2)*a(n-4)=0. - _R. J. Mathar_, Jun 23 2013
%K A026329 nonn
%O A026329 4,2
%A A026329 _Clark Kimberling_