|
|
A273397
|
|
a(n) = Fibonacci(Catalan(n)).
|
|
3
|
|
|
|
OFFSET
|
0,4
|
|
COMMENTS
|
Next term, a(8), which has 299 digits, is too large to include. Counterpart to A273398.
The number of digits of a(n) grows faster than Fibonacci(n), in contrast to A273398, and faster than Catalan(n-2), but slower than Catalan(n-1) or Catalan(n).
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
For n = 3, a(3) = Fibonacci(Catalan(3)) = Fibonacci(5) = 5.
|
|
MAPLE
|
a:= n-> (<<0|1>, <1|1>>^(binomial(2*n, n)/(n+1)))[1, 2]:
|
|
MATHEMATICA
|
Fibonacci[CatalanNumber[Range[0, 7]]]
|
|
PROG
|
(PARI) for(n=0, 7, cn=binomial(2*n, n)/(n+1); print1(fibonacci(cn) ", "))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|