|
|
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
|
|
|
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
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
b-file shortened by N. J. A. Sloane, Aug 31 2009 to remove exceptionally large numbers
|
|
STATUS
|
approved
|
|
|
|