cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A047150 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=5x/3. (Thus a path crosses the line only at lattice points and on right-steps.).

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 2, 4, 4, 1, 1, 3, 6, 8, 5, 1, 1, 4, 3, 14, 13, 6, 1, 1, 5, 7, 17, 27, 19, 7, 1, 1, 6, 12, 24, 44, 46, 26, 8, 1, 1, 7, 18, 36, 68, 90, 72, 34, 9, 1, 1, 8, 25, 54, 104, 158, 162, 106, 43, 10, 1, 1, 9, 33, 79, 54, 262, 320
Offset: 0

Views

Author

Clark Kimberling. Definition revised Dec 08 2006

Keywords