login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A082371
Indices n such that the congruence prime(n)^x + prime(n+1)^x == prime(n+2) mod prime(n+3) has no solution.
5
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?
EXAMPLE
For index = 7 prime(7) = 17 and 17^x + 19^x ~= 23 mod 29 has no solutions.
PROG
(PARI) \No solutions to prime(i)^x+prime(i+1)^x ~= prime(i+2) mod prime(i+3) 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
KEYWORD
easy,nonn
AUTHOR
Cino Hilliard, May 11 2003
STATUS
approved