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.

Showing 1-1 of 1 results.

A227576 Numbers k such that F(3*k)/(2*F(k)) is prime, where F(m) is the m-th Fibonacci number.

Original entry on oeis.org

5, 7, 11, 13, 17, 31, 37, 41, 67, 107, 151, 257, 349, 457, 787, 911, 1289, 1627, 3271, 8233, 13163, 14551, 31517, 55579, 103289
Offset: 1

Views

Author

Thomas Ordowski, Jul 16 2013

Keywords

Comments

All terms are primes. Conjecture: this sequence is infinite.

Examples

			For n = 5 we have F(3*5)/(2*F(5)) = F(15)/(2*5) = 610/10 = 61 is prime.
		

Crossrefs

Programs

  • Mathematica
    Select[Range[1000], PrimeQ[Fibonacci[3*#]/Fibonacci[#]/2] &] (* Vaclav Kotesovec, Jul 18 2013 *)
  • PARI
    forprime(p=5,1e4,if(ispseudoprime(t=fibonacci(3*p)/fibonacci(p) /2), print1(p", "))) \\ Charles R Greathouse IV, Jul 16 2013
    
  • PFGW
    ABC2 F(3*$a)/2/F($a)
    a: primes from 5 to 25000
    // Charles R Greathouse IV, Jul 16 2013

Extensions

a(6)-a(22) from Charles R Greathouse IV, Jul 16 2013
a(23) from Vaclav Kotesovec, Jul 18 2013
a(24) from Charles R Greathouse IV, Jul 18 2013
a(25) from Michael S. Branicky, Nov 06 2024
Showing 1-1 of 1 results.