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

 


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A166472 a(n) = 2^F(n+2)*3^F(n+1)/12, where F(n) is the n-th Fibonacci number (A000045(n)). 3

%I #13 Jul 30 2024 03:05:22

%S 1,6,72,5184,4478976,278628139008,14975624970497949696,

%T 50071566192138943522512952098816,

%U 8998235963747242817865410245394871488270255869919232

%N a(n) = 2^F(n+2)*3^F(n+1)/12, where F(n) is the n-th Fibonacci number (A000045(n)).

%H G. C. Greubel, <a href="/A166472/b166472.txt">Table of n, a(n) for n = 1..15</a>

%F a(n) = A166470(n+1)/12.

%F a(n) = 12*a(n-1)*a(n-2), for n > 1, with a(0) = 1/2, a(1) = 1.

%F A166469(A002110(m)*a(n)) = Fibonacci(m+n+1), for m > 1.

%F A166469(a(n)) = Fibonacci(n+3) - 2 = A001911(n).

%t Table[(2^Fibonacci[n+2]*3^Fibonacci[n+1])/12, {n,12}] (* _G. C. Greubel_, May 15 2016 *)

%t (3^#[[1]] 2^#[[2]])/12&/@Partition[Fibonacci[Range[2,15]],2,1] (* _Harvey P. Dale_, Jul 12 2021 *)

%o (Magma) [2^(Fibonacci(n+2)-2)*3^(Fibonacci(n+1)-1): n in [1..12]]; // _G. C. Greubel_, Jul 30 2024

%o (SageMath) [2^(fibonacci(n+2)-2)*3^(fibonacci(n+1)-1) for n in range(1,13)] # _G. C. Greubel_, Jul 30 2024

%Y Cf. A000045, A001911, A002110, A166469, A166470, A166471, A166473.

%Y Subsequence of A003586, A025487.

%K nonn

%O 1,2

%A _Matthew Vandermast_, Nov 05 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 18 13:18 EDT 2024. Contains 376000 sequences. (Running on oeis4.)