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.

A121877 Numbers k such that (5^k - 3^k)/2 = A005059(k) is prime.

This page as a plain text file.
%I A121877 #39 Jul 29 2023 20:53:18
%S A121877 13,19,23,31,47,127,223,281,2083,5281,7411,7433,19051,27239,35863,
%T A121877 70327,128941,147571,182099,866029
%N A121877 Numbers k such that (5^k - 3^k)/2 = A005059(k) is prime.
%C A121877 All terms are primes. Their indices are listed in A123704.
%C A121877 Corresponding primes are listed in A123705.
%C A121877 If it exists, a(17) > 125000. - _Robert Price_, Aug 15 2011
%C A121877 If it exists, a(21) > 1000000. - _Jon Grantham_, Jul 29 2023
%H A121877  OEIS Wiki, <a href="http://oeis.org/wiki/Primes_of_the_form_(a%5En%2Bb%5En)/(a%2Bb)_and_(a%5En-b%5En)/(a-b)">Primes of the form (a^n+b^n)/(a+b) and (a^n-b^n)/(a-b)</a>.
%H A121877 Jon Grantham and Andrew Granville, <a href="https://arxiv.org/abs/2307.07894">Fibonacci primes, primes of the form 2^n-k and beyond</a>, arXiv:2307.07894 [math.NT], 2023.
%F A121877 a(n) = prime(A123704(n)).
%t A121877 Do[f=(5^n-3^n)/2;If[PrimeQ[f],Print[{n,f}]],{n,1,300}]
%o A121877 (PARI) forprime(p=2,1e4,if(ispseudoprime((5^p-3^p)>>1),print1(p", "))) \\ _Charles R Greathouse IV_, Jun 16 2011
%Y A121877 Cf. A005058, A005059, A109347, A120612, A081186, A121824, A123704, A123705.
%K A121877 nonn,hard,more
%O A121877 1,1
%A A121877 _Alexander Adamchuk_, Aug 31 2006, Oct 08 2006
%E A121877 More terms from _Farideh Firoozbakht_, Oct 11 2006
%E A121877 a(13)-a(16) from _Robert Price_, Aug 15 2011
%E A121877 a(17)-a(19) from _Kellen Shenton_, May 18 2022
%E A121877 a(20) from _Jon Grantham_, Jul 29 2023