The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A038738 Path-counting array T(i,j) obtained from array t in A038792 by T(i,j)=t(2i+1,j). 6
 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 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS T(n,n)=A001906(n) for n >= 0 (even-indexed Fibonacci numbers). Row sums: A030267. LINKS Table of n, a(n) for n=1..54. EXAMPLE Rows: {1}; {1,3}; {1,5,8}; {1,7,17,21}; ... CROSSREFS Sequence in context: A140991 A302191 A261712 * A210741 A208760 A340156 Adjacent sequences: A038735 A038736 A038737 * A038739 A038740 A038741 KEYWORD nonn,tabl AUTHOR Clark Kimberling, May 02 2000 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 21 22:50 EST 2024. Contains 370239 sequences. (Running on oeis4.)