|
|
A174677
|
|
a(n) = 2*a(n-1)*a(n-2) with a(0)=1 and a(1)=1.
|
|
3
|
|
|
1, 1, 2, 4, 16, 128, 4096, 1048576, 8589934592, 18014398509481984, 309485009821345068724781056, 11150372599265311570767859136324180752990208
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
a(n) = 2^(Fibonacci(n+1)-1).
a(n) is the number of node minimal AVL trees of height n. - Alois P. Heinz, Mar 13 2013
|
|
LINKS
|
|
|
MATHEMATICA
|
RecurrenceTable[{a[1]==1, a[2]==2, a[n]==2a[n-1]a[n-2]}, a[n], {n, 12}] (* Harvey P. Dale, Jul 07 2011 *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|