Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A047110
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A047110 Array 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 up-step crosses the line y=2x/3. (Thus a path crosses the line only at lattice points and on right-steps.). +0
15
1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 3, 2, 3, 1, 1, 4, 5, 5, 4, 1, 1, 5, 9, 10, 9, 5, 1, 1, 6, 14, 19, 10, 14, 6, 1, 1, 7, 20, 33, 29, 24, 20, 7, 1, 1, 8, 27, 53, 62, 29, 44, 27, 8, 1, 1, 9, 35, 80, 115, 91, 73, 71, 35, 9, 1, 1, 10, 44, 115, 195, 206, 164 (list; table; graph; listen)
OFFSET

0,8

COMMENT

T is the transpose of the array in A125778.

EXAMPLE

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

CROSSREFS

Cf. A125778.

Adjacent sequences: A047107 A047108 A047109 this_sequence A047111 A047112 A047113

Sequence in context: A050176 A047130 A125778 this_sequence A093869 A057431 A057060

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu). Definition revised Dec 08 2006

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 October 13 02:37 EDT 2008. Contains 145008 sequences.


AT&T Labs Research