id:A026552 - OEIS Search Results

Search: id:A026552

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/2 + 1 ] for i >= 1, for even n >= 2, T(i,j)=T(i-1,j-2)+T(i-1,j-1)+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) for 2<=j<=2i-2.

+0
21

1, 1, 1, 1, 1, 2, 3, 2, 1, 1, 2, 4, 4, 4, 2, 1, 1, 3, 7, 10, 12, 10, 7, 3, 1, 1, 3, 8, 13, 19, 20, 19, 13, 8, 3, 1, 1, 4, 12, 24, 40, 52, 58, 52, 40, 24, 12, 4, 1, 1, 4, 13, 28, 52, 76, 98, 104, 98, 76, 52, 28, 13, 4, 1, 1, 5, 18, 45, 93, 156, 226, 278 (list; table; graph; listen)

	OFFSET	`1,6`
	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 or i=1, \|s(i)-s(i-1)\|=1 if i is odd and >=3.`
	CROSSREFS	`Sequence in context: A105734 A076839 A092542 this_sequence A086437 A027907 A026323` `Adjacent sequences: A026549 A026550 A026551 this_sequence A026553 A026554 A026555`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified July 25 02:12 EDT 2008. Contains 142294 sequences.

AT&T Labs Research