login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A166472
a(n) = 2^F(n+2)*3^F(n+1)/12, where F(n) is the n-th Fibonacci number (A000045(n)).
3
1, 6, 72, 5184, 4478976, 278628139008, 14975624970497949696, 50071566192138943522512952098816, 8998235963747242817865410245394871488270255869919232
OFFSET
1,2
LINKS
FORMULA
a(n) = A166470(n+1)/12.
a(n) = 12*a(n-1)*a(n-2), for n > 1, with a(0) = 1/2, a(1) = 1.
A166469(A002110(m)*a(n)) = Fibonacci(m+n+1), for m > 1.
A166469(a(n)) = Fibonacci(n+3) - 2 = A001911(n).
MATHEMATICA
Table[(2^Fibonacci[n+2]*3^Fibonacci[n+1])/12, {n, 12}] (* G. C. Greubel, May 15 2016 *)
(3^#[[1]] 2^#[[2]])/12&/@Partition[Fibonacci[Range[2, 15]], 2, 1] (* Harvey P. Dale, Jul 12 2021 *)
PROG
(Magma) [2^(Fibonacci(n+2)-2)*3^(Fibonacci(n+1)-1): n in [1..12]]; // G. C. Greubel, Jul 30 2024
(SageMath) [2^(fibonacci(n+2)-2)*3^(fibonacci(n+1)-1) for n in range(1, 13)] # G. C. Greubel, Jul 30 2024
CROSSREFS
KEYWORD
nonn
AUTHOR
Matthew Vandermast, Nov 05 2009
STATUS
approved