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
2, 6, 12, 72, 864, 62208, 53747712, 3343537668096, 179707499645975396352, 600858794305667322270155425185792, 107978831564966913814384922944738457859243070439030784 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

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

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

LINKS

Table of n, a(n) for n=0..10.

FORMULA

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

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 *)

CROSSREFS

Cf. A000045.

Subsequence of A003586, A025487.

Sequence in context: A178846 A173843 A107763 * A144144 A226178 A129085

Adjacent sequences:  A166467 A166468 A166469 * A166471 A166472 A166473

KEYWORD

nonn

AUTHOR

Matthew Vandermast, Nov 05 2009

EXTENSIONS

Typo corrected by Matthew Vandermast, Nov 07 2009

STATUS

approved

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 January 22 14:23 EST 2021. Contains 340362 sequences. (Running on oeis4.)