Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A047140
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A047140 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=4x/3. (Thus a path crosses the line only at lattice points and on right-steps.). +0
10
1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 2, 4, 4, 1, 1, 3, 2, 8, 5, 1, 1, 4, 5, 10, 13, 6, 1, 1, 5, 9, 15, 23, 19, 7, 1, 1, 6, 14, 24, 38, 42, 26, 8, 1, 1, 7, 20, 38, 62, 80, 68, 34, 9, 1, 1, 8, 27, 58, 38, 142, 148, 102, 43, 10, 1, 1, 9, 35, 85, 96, 180, 290 (list; table; graph; listen)
OFFSET

0,5

CROSSREFS

Adjacent sequences: A047137 A047138 A047139 this_sequence A047141 A047142 A047143

Sequence in context: A104562 A111603 A136178 this_sequence A047150 A102054 A111604

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 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research