|
|
A134788
|
|
If Fibonacci(prime(k)) is prime, append Fibonacci(prime(k)) - prime(k) to the sequence.
|
|
5
|
|
|
-1, 0, 6, 78, 220, 1580, 28634, 514200, 433494394, 2971215026, 99194853094755414, 1066340417491710595814572038, 19134702400093278081449423780, 475420437734698220747368027166749382927701417016557193662268716376935475882
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
|
|
MATHEMATICA
|
k = {}; Do[If[PrimeQ[Fibonacci[Prime[n]]], AppendTo[k, Fibonacci[Prime[n]] - Prime[n]]], {n, 1, 100}]; k
fpn[n_]:=Module[{prn=Prime[n], fib}, fib=Fibonacci[prn]; If[PrimeQ[fib], fib- prn, a]]; DeleteCases[Table[fpn[i], {i, 100}], a] (* Harvey P. Dale, Mar 27 2012 *)
|
|
PROG
|
(PARI) forprime(n=1, 1000, if(isprime(fibonacci(n)), print1(fibonacci(n)-n, ", "))) \\ Edward Jiang, Nov 23 2013
|
|
CROSSREFS
|
|
|
KEYWORD
|
sign
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|