login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A102307 a(n) = Fibonacci(2n+1) * binomial(2n,n). 1
1, 4, 30, 260, 2380, 22428, 215292, 2093520, 20553390, 203280220, 2022339176, 20215564824, 202879303900, 2042865050800, 20629119101400, 208829908532880, 2118554718825420, 21533269718832300 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Central column of triangle A016095.

LINKS

Table of n, a(n) for n=0..17.

FORMULA

a(n) = Fibonacci(2n+1) * binomial(2n,n) = A000045(2n+1) * A000984(n). - Philippe Deléham, Oct 14 2006

a(n) = A016095(n,n).

EXAMPLE

a(0) = F(1)*C(0,0) = 1*1 = 1;

a(1) = F(3)*C(2,1) = 2*2 = 4;

a(2) = F(5)*C(4,2) = 5*6 = 30;

a(3) = F(7)*C(6,3) = 13*20 = 260; ...

MATHEMATICA

Table[Fibonacci[2n+1]Binomial[2n, n], {n, 0, 20}] (* Harvey P. Dale, Aug 03 2016 *)

PROG

(PARI) a(n)=fibonacci(2*n+1)*binomial(2*n, n)

CROSSREFS

Sequence in context: A086452 A091527 A201200 * A209441 A330801 A052658

Adjacent sequences:  A102304 A102305 A102306 * A102308 A102309 A102310

KEYWORD

nonn

AUTHOR

Ralf Stephan, Jan 03 2005

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 April 7 13:36 EDT 2020. Contains 333305 sequences. (Running on oeis4.)