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!)
A130407 A diagonal of triangle A130405. 2
1, 3, 9, 37, 233, 2254, 34342, 827262, 31730508, 1943441460, 190609515540, 29988517246560, 7579307667005280, 3080578207713982560, 2015291663362285214400, 2123462159890867147060800 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = F(n+1)*a(n-1) + F(n+2)*A003266(n), where A003266(n) is the product of the first n nonzero Fibonacci numbers (A000045) and F(n) = A000045(n).
a(n) = A003266(n)*[ F(n+2) + F(n+1)*Sum_{k=0..n} F(k+1)/F(k) ] where F(n)=A000045(n) is the n-th Fibonacci number.
EXAMPLE
a(n) = A003266(n)*[F(n+2) + F(n+1)*[1+ 2/1+ 3/2+ 5/3+...+ F(n+1)/F(n)]]:
a(3) = 1*1*2*( 5 + 3*(1/1 + 2/1 + 3/2) ) = 37;
a(4) = 1*1*2*3*( 8 + 5*(1/1 + 2/1 + 3/2 + 5/3) ) = 233;
a(5) = 1*1*2*3*5*( 13 + 8*(1/1 + 2/1 + 3/2 + 5/3 + 8/5) ) = 2254.
PROG
(PARI) a(n)=polcoeff(prod(i=0, n+1, fibonacci(i+1)+x*fibonacci(i)), n)
(PARI) /* Recurrence a(n) = F(n+1)*a(n-1) + F(n+2)*A003266(n): */ {a(n)=if(n==0, 1, fibonacci(n+1)*a(n-1)+fibonacci(n+2)*prod(i=1, n, fibonacci(i)))}
(PARI) a(n)=prod(i=1, n, fibonacci(i))*(fibonacci(n+2) + fibonacci(n+1)*sum(k=1, n, fibonacci(k+1)/fibonacci(k)) )
CROSSREFS
Sequence in context: A222518 A107886 A220452 * A137031 A047148 A149023
KEYWORD
nonn
AUTHOR
Paul D. Hanna, May 24 2007, May 25 2007
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)