|
|
A166470
|
|
a(n) = 2^F(n+1)*3^F(n), where F(n) is the n-th Fibonacci number, A000045(n).
|
|
5
|
|
|
2, 6, 12, 72, 864, 62208, 53747712, 3343537668096, 179707499645975396352, 600858794305667322270155425185792, 107978831564966913814384922944738457859243070439030784
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
LINKS
|
|
|
FORMULA
|
For n > 1, a(n) = a(n-1)*a(n-2).
|
|
MATHEMATICA
|
3^First[#] 2^Last[#]&/@Partition[Fibonacci[Range[0, 12]], 2, 1] (* Harvey P. Dale, Aug 20 2012 *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|