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

 

Logo
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

%I #5 Mar 30 2012 18:56:32

%S 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,

%T 314,370,377,1,15,93,313,643,895,979,987,1,17,122,486,1201,1993,2455,

%U 2575,2584,1,19,155,715,2080,4082,5798,6590,6755

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

%C T(n,n)=A001906(n) for n >= 0 (even-indexed Fibonacci numbers).

%C Row sums: A030267.

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

%K nonn,tabl

%O 1,3

%A _Clark Kimberling_, May 02 2000

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 05:19 EDT 2024. Contains 371782 sequences. (Running on oeis4.)