cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A134788 If Fibonacci(prime(k)) is prime, append Fibonacci(prime(k)) - prime(k) to the sequence.

Original entry on oeis.org

-1, 0, 6, 78, 220, 1580, 28634, 514200, 433494394, 2971215026, 99194853094755414, 1066340417491710595814572038, 19134702400093278081449423780, 475420437734698220747368027166749382927701417016557193662268716376935475882
Offset: 1

Views

Author

Artur Jasinski, Nov 12 2007

Keywords

Crossrefs

Programs

  • 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 *)
  • PARI
    forprime(n=1,1000,if(isprime(fibonacci(n)),print1(fibonacci(n)-n,","))) \\ Edward Jiang, Nov 23 2013