A324141 Define b(n) and c(n) by b(0)=0, b(1)=c(0)=c(1)=1; b(n)=c(n-1)*c(n-2), c(n) = (b(n-1)+c(n-1))*(b(n-2)+c(n-2)); sequence gives c(n).

1, 1, 2, 6, 24, 288, 15552, 9704448, 318616436736, 6659685075614957568, 4578804751138453509192623849472, 65342994997096325845410944896525471363735926865920

Offset

0,3

Links

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

S. G. Wagner, The Fibonacci number of Fibonacci trees and a related family of polynomial recurrence systems, Fib. Q., 45 (2007), 247-253.

Maple

f:=proc(n) option remember;
if n=0 then [0, 1];
elif n=1 then [1, 1]
else
[f(n-1)[2]*f(n-2)[2], (f(n-1)[1]+f(n-1)[2])*(f(n-2)[1]+f(n-2)[2])];
fi; end;
[seq(f(n), n=0..11)];

Crossrefs

Cf. A324140.

Sequence in context: A114778 A292751 A274098 * A277423 A191460 A073475

Adjacent sequences: A324138 A324139 A324140 * A324142 A324143 A324144

Keyword

nonn

Author

N. J. A. Sloane, Feb 20 2019

Status

approved