The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A047050

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

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.
(history; published version)

#5 by Russ Cox at Fri Mar 30 18:56:51 EDT 2012

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Clark Kimberling

Discussion

Fri Mar 30

18:56

OEIS Server: https://oeis.org/edit/global/285

#4 by N. J. A. Sloane at Wed Sep 22 03:00:00 EDT 2004

NAME

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.

KEYWORD

nonn,tabl,new

#3 by N. J. A. Sloane at Sat Sep 13 03:00:00 EDT 2003

KEYWORD

nonn,tabl,new

AUTHOR

Clark Kimberling, (ck6(AT)evansville.edu)

#2 by N. J. A. Sloane at Fri May 16 03:00:00 EDT 2003

KEYWORD

nonn,tabl,new

AUTHOR

Clark Kimberling, ck6@cedar.(AT)evansville.edu

#1 by N. J. A. Sloane at Sat Dec 11 03:00:00 EST 1999

NAME

Array T 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.

DATA

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

OFFSET

0,9

EXAMPLE

Diagonals (beginning on row 0): {1}; {1,1}; {1,1,1}; {1,1,2,1}; ...

CROSSREFS

Mirror image of A047040.

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling, [email protected]

STATUS

approved