login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A047070 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 unless x=0 or x=h. 0
1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 3, 1, 1, 2, 2, 5, 4, 1, 1, 3, 4, 7, 9, 5, 1, 1, 4, 3, 7, 16, 14, 6, 1, 1, 5, 7, 7, 23, 30, 20, 7, 1, 1, 6, 12, 14, 30, 53, 50, 27, 8, 1, 1, 7, 18, 12, 30, 83, 103, 77, 35, 9, 1, 1, 8, 25, 30, 30, 113, 186, 180, 112, 44 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,7

LINKS

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

EXAMPLE

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

CROSSREFS

Sequence in context: A280134 A143488 A201159 * A071127 A029381 A297877

Adjacent sequences:  A047067 A047068 A047069 * A047071 A047072 A047073

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 21 08:27 EDT 2018. Contains 316405 sequences. (Running on oeis4.)