Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,8

COMMENT

T = transpose of A047110.

EXAMPLE

Northwest corner:

1 1 1 1 1 1

1 1 2 3 4 5

1 2 2 5 9 14

1 3 5 10 10 24

1 4 9 19 29 29

CROSSREFS

Cf. A047110.

Sequence in context: A075532 A050176 A047130 this_sequence A047110 A093869 A057431

Adjacent sequences: A125775 A125776 A125777 this_sequence A125779 A125780 A125781

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu), 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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research