This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A111135 Product_{k=1..n} F(p(k)), where p(k) is the k-th prime and F(k) is the k-th Fibonacci number. 1
 1, 2, 10, 130, 11570, 2695810, 4305208570, 18000077031170, 515828207482238690, 265253823305384119320010, 357102999447516172932830542690, 8626828910804196810251673542315707730 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Harry J. Smith, Table of n, a(n) for n = 1..50 EXAMPLE The first 3 primes are 2, 3 and 5. So a(3) = F(2)*F(3)*F(5) = 1*2*5 = 10. MATHEMATICA f[n_] := Product[Fibonacci[Prime[i]], {i, n}]; Array[f, 12] (* Robert G. Wilson v, Oct 21 2005 *) PROG (PARI) { a=1; n=0; forprime (p=2, 425, n++; a=a*fibonacci(p); write("b111135.txt", n, " ", a); ) } \\ Harry J. Smith, Mar 08 2009 CROSSREFS Sequence in context: A294350 A194158 A323715 * A097928 A254431 A011838 Adjacent sequences:  A111132 A111133 A111134 * A111136 A111137 A111138 KEYWORD nonn AUTHOR Leroy Quet, Oct 17 2005 EXTENSIONS More terms from Robert G. Wilson v, Oct 21 2005 b-file shortened by N. J. A. Sloane, Aug 31 2009 to remove exceptionally large numbers 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.

Last modified August 24 14:10 EDT 2019. Contains 326281 sequences. (Running on oeis4.)