|
|
A100701
|
|
a(n) = a(n-1) + a(n-2) + a(n-1)*a(n-2) for n>=2; a(0)=2, a(1)=3.
|
|
1
|
|
|
2, 3, 11, 47, 575, 27647, 15925247, 440301256703, 7011906707722862591, 3087351335301583621409910816767, 21648219537098310851336266290644502090473753542655
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
In general, if b(n) is defined recursively by b(0) = p, b(1) = q, b(n) = b(n-1) + b(n-2) + b(n-1) * b(n-2) for n >= 2 then b(n) = p^Fibonacci(n-1) * q^Fibonacci(n) - 1. - Rahul Goswami, Apr 15 2020
|
|
LINKS
|
|
|
FORMULA
|
a(n) = a(n-1) + a(n-2) + a(n-1)*a(n-2) with a(0)=2 and a(1)=3.
a(n) = 3^Fibonacci(n-1) * 4^Fibonacci(n) - 1. - Rahul Goswami, Apr 15 2020
|
|
EXAMPLE
|
a(2) = (2 + 3) + 2*3 = 11.
|
|
MATHEMATICA
|
|
|
PROG
|
(PARI) a(n)={3^fibonacci(n-1) * 4^fibonacci(n) - 1} \\ Andrew Howroyd, Apr 14 2020
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|