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.

A091567 Primes p such that p^2-p-1 is prime.

This page as a plain text file.
%I A091567 #17 May 31 2022 06:48:20
%S A091567 3,5,7,11,17,29,31,47,61,67,71,97,101,127,131,139,149,181,197,241,269,
%T A091567 307,331,359,379,397,409,419,421,449,457,479,487,491,599,607,617,619,
%U A091567 641,647,677,709,751,787,839,857,907,947,967,977,997,1051,1061,1091
%N A091567 Primes p such that p^2-p-1 is prime.
%D A091567 M. Cerasoli, F. Eugeni and M. Protasi, Elementi di Matematica Discreta, Bologna 1988
%D A091567 Emanuele Munarini and Norma Zagaglia Salvi, Matematica Discreta,UTET, CittaStudiEdizioni, Milano 1997
%H A091567 T. D. Noe, <a href="/A091567/b091567.txt">Table of n, a(n) for n = 1..1000</a>
%t A091567 Select[Prime[Range[250]], PrimeQ[ #^2-#-1]&] (* _Alexander Adamchuk_, Jul 27 2006 *)
%o A091567 (PARI) isA091567(n)=isprime(n) && isprime(n^2-n-1) \\ _Michael B. Porter_, May 12 2010
%Y A091567 Cf. A053182 (p^2+p+1 prime), A053184 (p^2+p-1 prime), A065508 (p^2-p+1 prime).
%Y A091567 Cf. A091568 (corresponding primes of the form p^2-p-1).
%K A091567 nonn
%O A091567 1,1
%A A091567 _T. D. Noe_, Jan 21 2004