Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A047120
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A047120 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 touches the line y=x/4 only at lattice points. +0
10
1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 3, 1, 1, 1, 4, 6, 4, 2, 1, 1, 5, 10, 10, 6, 3, 1, 1, 6, 15, 20, 16, 6, 4, 1, 1, 7, 21, 35, 36, 22, 6, 5, 1, 1, 8, 28, 56, 71, 58, 28, 6, 6, 1, 1, 9, 36, 84, 127, 129, 86, 34, 12, 7, 1, 1, 10, 45, 120, 211, 256, 215 (list; table; graph; listen)
OFFSET

0,8

CROSSREFS

Sequence in context: A124279 A135225 A047030 this_sequence A096751 A099233 A133815

Adjacent sequences: A047117 A047118 A047119 this_sequence A047121 A047122 A047123

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 9 18:50 EST 2009. Contains 170568 sequences.


AT&T Labs Research