The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A047020 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=2x/3 unless x=0 or x=h. 9
 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 2, 2, 1, 1, 4, 5, 4, 3, 1, 1, 5, 9, 5, 3, 4, 1, 1, 6, 14, 14, 5, 7, 5, 1, 1, 7, 20, 28, 19, 7, 12, 6, 1, 1, 8, 27, 48, 47, 19, 19, 18, 7, 1, 1, 9, 35, 75, 95, 66, 38, 37, 25, 8, 1, 1, 10, 44, 110, 170, 161, 66, 37, 62, 33, 9 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,8 LINKS Table of n, a(n) for n=0..76. EXAMPLE Diagonals (beginning on row 0): {1}; {1,1}; {1,1,1}; {1,2,1,1}; ... CROSSREFS Sequence in context: A331183 A284082 A047040 * A127832 A107249 A062842 Adjacent sequences: A047017 A047018 A047019 * A047021 A047022 A047023 KEYWORD nonn,tabl AUTHOR Clark Kimberling STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 29 23:21 EST 2024. Contains 370428 sequences. (Running on oeis4.)