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.

A038738 Path-counting array T(i,j) obtained from array t in A038792 by T(i,j)=t(2i+1,j).

Original entry on oeis.org

1, 1, 3, 1, 5, 8, 1, 7, 17, 21, 1, 9, 30, 50, 55, 1, 11, 47, 103, 138, 144, 1, 13, 68, 188, 314, 370, 377, 1, 15, 93, 313, 643, 895, 979, 987, 1, 17, 122, 486, 1201, 1993, 2455, 2575, 2584, 1, 19, 155, 715, 2080, 4082, 5798, 6590, 6755
Offset: 1

Views

Author

Clark Kimberling, May 02 2000

Keywords

Comments

T(n,n)=A001906(n) for n >= 0 (even-indexed Fibonacci numbers).
Row sums: A030267.

Examples

			Rows: {1}; {1,3}; {1,5,8}; {1,7,17,21}; ...