login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A047040 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=3x/4 unless x=0 or x=h. 10
1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 2, 2, 1, 1, 4, 5, 2, 3, 1, 1, 5, 9, 5, 5, 4, 1, 1, 6, 14, 14, 10, 9, 5, 1, 1, 7, 20, 28, 14, 9, 14, 6, 1, 1, 8, 27, 48, 42, 14, 23, 20, 7, 1, 1, 9, 35, 75, 90, 56, 23, 43, 27, 8, 1, 1, 10, 44, 110, 165, 146, 56, 66, 70, 35 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

0,8

LINKS

Table of n, a(n) for n=0..75.

EXAMPLE

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

CROSSREFS

Mirror image of A047050.

Sequence in context: A345272 A331183 A284082 * A047020 A127832 A107249

Adjacent sequences:  A047037 A047038 A047039 * A047041 A047042 A047043

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 25 13:27 EDT 2021. Contains 348252 sequences. (Running on oeis4.)