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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A119694 a(n) = Fibonacci(n) * Catalan(n). 1
0, 1, 2, 10, 42, 210, 1056, 5577, 30030, 165308, 923780, 5231954, 29953728, 173095700, 1008263880, 5913855450, 34898020290, 207042729630, 1234218400800, 7388927397390, 44406274641300, 267807758800920, 1620247684628040, 9831059348368050, 59810275503119232 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..1000

FORMULA

a(n) = A000045(n) * A000108(n). - Alois P. Heinz, Aug 12 2017

MAPLE

seq(combinat[fibonacci](n)*(binomial(2*n, n)/(n+1)), n=0..27);

# second Maple program:

a:= proc(n) option remember; `if`(n<2, n,

      ((2*n-1)*(2*n*a(n-1)+(8*n-12)*a(n-2)))/(n*(n+1)))

    end:

seq(a(n), n=0..25);  # Alois P. Heinz, Aug 12 2017

MATHEMATICA

Table[Fibonacci[n]CatalanNumber[n], {n, 0, 30}] (* Harvey P. Dale, Aug 27 2017 *)

CROSSREFS

Cf. A000045, A000108, A000984.

Sequence in context: A084480 A309182 A099553 * A286760 A197048 A175613

Adjacent sequences:  A119691 A119692 A119693 * A119695 A119696 A119697

KEYWORD

easy,nonn

AUTHOR

Zerinvary Lajos, Jun 09 2006

EXTENSIONS

Name edited by Alois P. Heinz, Aug 12 2017

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 September 17 08:31 EDT 2019. Contains 327127 sequences. (Running on oeis4.)