id:A047050 - OEIS Search Results

Search: id:A047050

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=4x/3 unless x=0 or x=h.

+0
11

1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 3, 1, 1, 3, 2, 5, 4, 1, 1, 4, 5, 5, 9, 5, 1, 1, 5, 9, 10, 14, 14, 6, 1, 1, 6, 14, 9, 14, 28, 20, 7, 1, 1, 7, 20, 23, 14, 42, 48, 27, 8, 1, 1, 8, 27, 43, 23, 56, 90, 75, 35, 9, 1, 1, 9, 35, 70, 66, 56, 146, 165, 110, 44 (list; table; graph; listen)

	OFFSET	`0,9`
	EXAMPLE	`Diagonals (beginning on row 0): {1}; {1,1}; {1,1,1}; {1,1,2,1}; ...`
	CROSSREFS	`Mirror image of A047040.` `Sequence in context: A092334 A047060 A050167 this_sequence A057820 A054012 A062083` `Adjacent sequences: A047047 A047048 A047049 this_sequence A047051 A047052 A047053`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified September 7 23:08 EDT 2008. Contains 143486 sequences.

AT&T Labs Research