id:A026268 - OEIS Search Results

Search: id:A026268

Displaying 1-1 of 1 results found.

page 1

Triangular array T read by rows: T(i,0)=1 for i >= 0, T(2,1)=1, T(2,2)=1, T(3,1)=2, T(3,2)=2, T(3,3)=2; and for i >= 4, T(i,1)=i-1, T(i,i)=T(i-1,i-2)+T(i-1,i-1) and T(i,j)=T(i-1,j-2)+T(i-1,j-1)+T(i-1,j) for j=2,3,...,i-1.

+0
14

1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 3, 5, 6, 4, 1, 4, 9, 14, 15, 10, 1, 5, 14, 27, 38, 39, 25, 1, 6, 20, 46, 79, 104, 102, 64, 1, 7, 27, 72, 145, 229, 285, 270, 166, 1, 8, 35, 106, 244, 446, 659, 784, 721, 436, 1, 9, 44, 149, 385, 796, 1349, 1889, 2164, 1941, 1157, 1, 10, 54, 202, 578, 1330, 2530 (list; table; graph; listen)

	OFFSET	`1,7`
	FORMULA	`a(n) = number of nonneg. int. strings s(0), ..., s(n) such that s(n)=n-k, where s(0)=0, s(1)=1, \|s(i)-s(i-1)\|<=1 for i >= 2; \|s(2)-s(1)\|=1, \|s(3)-s(2)\|=1 if s(2)=1.`
	CROSSREFS	`Sequence in context: A063276 A055253 A103626 this_sequence A089258 A004065 A127496` `Adjacent sequences: A026265 A026266 A026267 this_sequence A026269 A026270 A026271`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research