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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A111119 Product{1<=k<=n,GCD(k,n)=1} F(k), where F(k) is the k-th Fibonacci number. 0
1, 1, 1, 2, 6, 5, 240, 130, 4095, 884, 122522400, 5785, 1570247078400, 7050580, 6402818331, 55911099400, 83044763560621070208000, 2152604285, 342696507457909818131702784000, 122400523811956, 16017296251646471425875 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
EXAMPLE
The positive integers <= 8 and coprime to 8 are 1,3,5,7. So a(8) = F(1)*F(3)*F(5)*F(7) = 1*2*5*13 = 130.
MATHEMATICA
f[n_] := Times @@ Fibonacci /@ Select[ Range[n], GCD[ #, n] == 1 &]; Array[f, 21] (* Robert G. Wilson v *)
CROSSREFS
Sequence in context: A298329 A009462 A346712 * A107495 A019716 A106152
KEYWORD
nonn
AUTHOR
Leroy Quet, Oct 15 2005
EXTENSIONS
More terms from Robert G. Wilson v, Oct 17 2005
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | 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 April 25 08:25 EDT 2024. Contains 371964 sequences. (Running on oeis4.)