Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A047040
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
11
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; listen)
OFFSET

0,8

EXAMPLE

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

CROSSREFS

Mirror image of A047050.

Sequence in context: A016442 A076360 A089398 this_sequence A047020 A127832 A107249

Adjacent sequences: A047037 A047038 A047039 this_sequence A047041 A047042 A047043

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research