login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


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

%I

%S 2,6,12,72,864,62208,53747712,3343537668096,179707499645975396352,

%T 600858794305667322270155425185792,

%U 107978831564966913814384922944738457859243070439030784

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

%C For m>1, n>1, A166469(A002110(m)*(a(n)^k)/12) = k*F(m+n).

%C A166469(a(n))=F(n+2)+1=A001611(n+2).

%F a(n)=A000301(n+1)*A010098(n).

%F For n>1, a(n) = a(n-1)*a(n-2).

%t 3^First[#] 2^Last[#]&/@Partition[Fibonacci[Range[0,12]],2,1] (* _Harvey P. Dale_, Aug 20 2012 *)

%Y Cf. A000045.

%Y Subsequence of A003586, A025487.

%K nonn

%O 0,1

%A _Matthew Vandermast_, Nov 05 2009

%E Typo corrected by _Matthew Vandermast_, Nov 07 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 25 19:39 EST 2021. Contains 341618 sequences. (Running on oeis4.)