login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A038737 T(n,n-2), array T as in A038792. 1
1, 6, 23, 73, 211, 581, 1560, 4135, 10890, 28590, 74946, 196326, 514123, 1346148, 3524441, 9227311, 24157645, 63245795, 165579930, 433494205, 1134902916, 2971214796, 7778741748, 20365010748, 53316290821, 139583862066 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,2

LINKS

Table of n, a(n) for n=2..27.

FORMULA

Fifth 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

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

a(n) = Sum_{k=0..n}(binomial(n+2,k+3)*Fibonacci(k)). - Vladimir Kruchinin, Oct 24 2016

PROG

(Maxima)

a(n):=sum(binomial(n+2, k+3)*fib(k), k, 0, n); /* Vladimir Kruchinin, Oct 24 2016 */

CROSSREFS

Apparently the same as A038797.

Sequence in context: A213557 A273386 A045618 * A038797 A136530 A259033

Adjacent sequences:  A038734 A038735 A038736 * A038738 A038739 A038740

KEYWORD

nonn

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 26 10:18 EDT 2019. Contains 321491 sequences. (Running on oeis4.)