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.

A117740 Prime Fibonacci numbers that are Chen primes.

Original entry on oeis.org

2, 3, 5, 13, 89, 233, 514229
Offset: 1

Views

Author

Jani Melik, Apr 28 2006; corrected Apr 28 2006

Keywords

Crossrefs

Programs

  • Maple
    ischenprime:=proc(n); if (isprime(n) = 'true') then if (isprime(n+2) = 'true' or numtheory[bigomega](n+2) = 2) then RETURN('true') else RETURN('false') fi fi end: ts_prime_fibonacci_chen:=proc(n) local i, tren, ans; ans:= [ ]: for i from 0 to n do tren := combinat[fibonacci](i): if (isprime( tren ) = 'true' and ischenprime(tren) = 'true') then ans:=[op(ans), tren]: fi od; RETURN(ans) end: ts_prime_fibonacci_chen(300); # Jani Melik, May 05 2006