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.

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

Original entry on oeis.org

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

Views

Author

Cino Hilliard, May 11 2003

Keywords

Comments

Is this sequence infinite? Proof?

Examples

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

Programs

  • 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" ")) ) }