login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082374 Set of n such that the prime quadruple p(n), p(n+1), p(n+2), p(n+3) does not have a solution for the congruence p(n+1)^x - p(n)^x == p(n+2) mod p(n+3). 0
2, 6, 16, 17, 18, 20, 21, 25, 29, 31, 33, 35, 36, 41, 45, 52, 53, 59, 61, 62, 64, 65, 77, 79, 81, 83, 84, 85, 88, 90, 91, 94, 95, 96, 100, 101, 102, 103, 104, 106, 110, 114, 116, 117, 119, 122, 132, 136, 137, 139, 147, 152, 154, 155, 156, 157, 158, 164, 167, 172, 173 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..61.

EXAMPLE

2 is in the sequence because prime(2)=3, prime(2+1)=5, prime(2+2)=7, prime(2+3)=11 and 5^x-3^x == 7 mod 11 has no solutions.

PROG

(PARI program by Cino Hilliard) \Solutions to prime(i+1)^x-prime(i+1)^x == prime(i+2) mod prime(i+3) noanmbn(m, n) = { for(p=1, m, f=0; for(x=0, n, if((prime(p+1)^x-prime(p)^x-prime(p+2))%prime(p+3)==0, f=1) ); if(f==0, print1(p" ")) ) }

CROSSREFS

Cf. A082371.

Sequence in context: A151708 A036046 A080622 * A085226 A260376 A330866

Adjacent sequences:  A082371 A082372 A082373 * A082375 A082376 A082377

KEYWORD

easy,nonn

AUTHOR

Cino Hilliard, May 11 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 7 19:57 EDT 2020. Contains 336279 sequences. (Running on oeis4.)