id:A026519 - OEIS Search Results

Search: id:A026519

Displaying 1-1 of 1 results found.

page 1

Triangular array T read by rows: T(i,0)=T(i,2i)=1 for i >= 0, T(i,1)=T(i,2i-1)=[ (i+1)/2 ] for i >= 1; for even n >= 2, T(i,j)=T(i-1,j-2)+T(i-1,j) for 2<=j<=2i-2; for odd n >= 3, T(i,j)=T(i-1,j-2)+T(i-1,j-1)+T(i-1,j) for 2<=j<=2i-2.

+0
21

1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 4, 4, 4, 2, 1, 1, 2, 5, 6, 8, 6, 5, 2, 1, 1, 3, 8, 13, 19, 20, 19, 13, 8, 3, 1, 1, 3, 9, 16, 27, 33, 38, 33, 27, 16, 9, 3, 1, 1, 4, 13, 28, 52, 76, 98, 104, 98, 76, 52, 28, 13, 4, 1, 1, 4, 14, 32, 65, 104, 150, 180, 196, 180 (list; table; graph; listen)

	OFFSET	`1,7`
	FORMULA	`T(n, k) = number of integer strings s(0), ..., s(n) such that s(0)=0, s(n)=n-k, \|s(i)-s(i-1)\|=1 if i is even, \|s(i)-s(i-1)\|<= 1 if i is odd.`
	CROSSREFS	`Cf. A026527.` `Sequence in context: A129176 A134132 A030424 this_sequence A025177 A026148 A117211` `Adjacent sequences: A026516 A026517 A026518 this_sequence A026520 A026521 A026522`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.

AT&T Labs Research