cp's OEIS Frontend

A082484 First of four consecutive primes p, q, r, s such that neither of the congruences p^x+q^x = r (mod s) and q^x-p^x = r (mod s) has a solution.

%I A082484 #4 Oct 01 2013 17:57:37
%S A082484 3,53,71,97,109,127,137,149,151,179,197,239,293,311,401,419,431,439,
%T A082484 457,467,503,557,563,601,619,641,643,653,673,769,887,907,971,991,1021,
%U A082484 1031,1093,1103,1123,1151,1297,1361,1367,1373,1427,1447,1459,1471,1481
%N A082484 First of four consecutive primes p, q, r, s such that neither of the congruences p^x+q^x = r (mod s) and q^x-p^x = r (mod s) has a solution.
%C A082484 Is this sequence infinite?
%F A082484 a(n) = prime(A082475(n)).
%e A082484 2 is not in the sequence because 2^1+3^1 = 5 (mod 7).
%e A082484 17 is not in the sequence because 19^4-17^4 = 23 (mod 29).
%o A082484 (PARI) { for (p = 1, 300, f = 0; for (x = 1, prime(p + 3) - 1, if ((prime(p + 1)^x + prime(p)^x - prime(p + 2))%prime(p + 3) == 0 || (prime(p + 1)^x - prime(p)^x - prime(p + 2))%prime(p + 3) == 0, f = 1; break)); if (f == 0, print(prime(p)))) }
%Y A082484 Cf. A082371, A082475.
%K A082484 easy,nonn,less
%O A082484 1,1
%A A082484 _Cino Hilliard_, May 11 2003
%E A082484 Edited and extended by _David Wasserman_, Oct 12 2006