login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A324140 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 b(n). 1
0, 1, 1, 2, 12, 144, 6912, 4478976, 150923575296, 3091996642249801728, 2121885128576356504259996418048, 30493397665311618727858440951711886636410099204096 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

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. A324141.

Sequence in context: A321631 A221101 A187748 * A296137 A086928 A228551

Adjacent sequences: A324137 A324138 A324139 * A324141 A324142 A324143

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Feb 20 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 9 04:13 EST 2022. Contains 358698 sequences. (Running on oeis4.)