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!)
A038739 T(n,n-2), array T as in A038738. 2

%I #15 Oct 24 2016 02:46:35

%S 1,7,30,103,314,895,2455,6590,17480,46070,121016,317342,831465,

%T 2177613,5702054,14929365,39087010,102332805,267912735,701406940,

%U 1836309856,4807524652,12586266400,32951277148,86267567969,225851430035

%N T(n,n-2), array T as in A038738.

%F Sixth diagonal of array defined by T(i, 1)=T(1, j)=1, T(i, j)=Max(T(i-1, j)+T(i-1, j-1); T(i-1, j-1)+T(i, j-1)) - _Benoit Cloitre_, Aug 05 2003

%F G.f.: x^2/[(1-3x+x^2)(1-x)^4].

%F a(n) = Sum_{k=0..n}(binomial(n+3,k+4)*Fibonacci(k)). - _Vladimir Kruchinin_, Oct 24 2016

%o (Maxima)

%o a(n):=sum(binomial(n+3,k+4)*fib(k),k,0,n); /* _Vladimir Kruchinin_, Oct 24 2016 */

%K nonn

%O 2,2

%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 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)