A082371 Indices n such that the congruence prime(n)^x + prime(n+1)^x == prime(n+2) mod prime(n+3) has no solution.

2, 7, 9, 11, 16, 19, 20, 22, 23, 25, 28, 29, 30, 31, 32, 33, 35, 36, 37, 39, 40, 41, 45, 46, 49, 52, 54, 56, 62, 64, 66, 68, 69, 70, 79, 80, 81, 82, 83, 85, 88, 91, 96, 98, 102, 103, 108, 110, 114, 116, 117, 118, 119, 122, 123, 126, 131, 136, 143, 144, 148, 150, 154

Offset

1,1

Comments

Is this sequence infinite? Proof?

Links

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

Example

For index = 7 prime(7) = 17 and 17^x + 19^x ~= 23 mod 29 has no solutions.

Prog

(PARI) noanpbn(m, n) = { for(p=1, m, f=0; for(x=0, n, if((prime(p)^x+prime(p+1)^x-prime(p+2))%prime(p+3)==0, f=1) ); if( f==0, print1(p" ")) ) }

Crossrefs

Sequence in context: A297826 A288598 A277737 * A090348 A163405 A049638

Adjacent sequences: A082368 A082369 A082370 * A082372 A082373 A082374

Keyword

easy,nonn

Author

Cino Hilliard, May 11 2003

Status

approved