This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A166470 #62 Jun 01 2025 01:03:44 %S A166470 2,6,12,72,864,62208,53747712,3343537668096,179707499645975396352, %T A166470 600858794305667322270155425185792, %U A166470 107978831564966913814384922944738457859243070439030784 %N A166470 a(n) = 2^F(n+1)*3^F(n), where F(n) is the n-th Fibonacci number, A000045(n). %H A166470 G. C. Greubel, <a href="/A166470/b166470.txt">Table of n, a(n) for n = 0..16</a> %F A166470 a(n) = A000301(n+1)*A010098(n). %F A166470 For n > 1, a(n) = a(n-1)*a(n-2). %F A166470 For m > 1, n > 1, A166469(A002110(m)*(a(n)^k)/12) = k*Fibonacci(m+n). %F A166470 A166469(a(n)) = Fibonacci(n+2) + 1 = A001611(n+2). %F A166470 a(n) = 2 * A174666(n+1). - _Alois P. Heinz_, Sep 16 2022 %F A166470 a(n) = 2^(Fibonacci(n+1) + c*Fibonacci(n)), with c=log_2(3). Cf. A000301 (c=1) & A010098 (c=2). - _Andrea Pinos_, Sep 29 2022 %F A166470 a(n) = A115033(2*n+1). - _David Radcliffe_, May 31 2025 %t A166470 3^First[#] 2^Last[#]&/@Partition[Fibonacci[Range[0,12]],2,1] (* _Harvey P. Dale_, Aug 20 2012 *) %o A166470 (PARI) a(n)=2^fibonacci(n+1)*3^fibonacci(n) \\ _Charles R Greathouse IV_, Sep 19 2022 %o A166470 (Magma) [2^Fibonacci(n+1)*3^Fibonacci(n): n in [0..14]]; // _G. C. Greubel_, Jul 29 2024 %o A166470 (SageMath) [2^fibonacci(n+1)*3^fibonacci(n) for n in range(15)] # _G. C. Greubel_, Jul 29 2024 %Y A166470 Subsequence of A025610 and hence of A003586 and A025487. %Y A166470 Cf. A000045, A000301, A002110, A010098, A115033, A166469, A174666, A230900. %K A166470 nonn,easy %O A166470 0,1 %A A166470 _Matthew Vandermast_, Nov 05 2009 %E A166470 Typo corrected by _Matthew Vandermast_, Nov 07 2009