|
Search: id:A111119
|
|
|
| A111119 |
|
Product{1<=k<=n,GCD(k,n)=1} F(k), where F(k) is the k-th Fibonacci number. |
|
+0
1
|
|
| 1, 1, 1, 2, 6, 5, 240, 130, 4095, 884, 122522400, 5785, 1570247078400, 7050580, 6402818331, 55911099400, 83044763560621070208000, 2152604285, 342696507457909818131702784000, 122400523811956, 16017296251646471425875
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
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
|
Cf. A000045, A070964.
Sequence in context: A069113 A085057 A009462 this_sequence A107495 A019716 A106152
Adjacent sequences: A111116 A111117 A111118 this_sequence A111120 A111121 A111122
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet Oct 15 2005
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(at)rgwv.com), Oct 17 2005
|
|
|
Search completed in 0.002 seconds
|
