id:A047030 - OEIS Search Results

Search: id:A047030

Displaying 1-1 of 1 results found.

page 1

Array T read by diagonals: T(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and no step touches the line y=x/4 unless x=0 or x=h.

+0
9

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 3, 1, 1, 1, 4, 6, 4, 2, 1, 1, 5, 10, 10, 4, 1, 1, 1, 6, 15, 20, 14, 4, 2, 1, 1, 7, 21, 35, 34, 18, 4, 3, 1, 1, 8, 28, 56, 69, 52, 22, 4, 4, 1, 1, 9, 36, 84, 125, 121, 74, 26, 8, 5, 1, 1, 10, 45, 120, 209, 246, 195, 100 (list; table; graph; listen)

	OFFSET	`0,8`
	EXAMPLE	`Diagonals (beginning on row 0): {1}; {1,1}; {1,1,1}; {1,2,1,1}; ...`
	CROSSREFS	`Sequence in context: A124445 A124279 A135225 this_sequence A047120 A096751 A099233` `Adjacent sequences: A047027 A047028 A047029 this_sequence A047031 A047032 A047033`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.

AT&T Labs Research