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.

A260377 Primes p such that A001221(p-1)^(p-1) == 1 (mod p^2).

Original entry on oeis.org

3, 5, 17, 257, 1093, 3511, 65537, 1006003
Offset: 1

Views

Author

Felix Fröhlich, Jul 23 2015

Keywords

Comments

No further terms up to 10^9.
All currently (as of 2015-07-23) known terms of A001220 and A019434 are in the sequence, as is A014127(2), but A014127(1) is not.

Examples

			A001221(1092) == 4 and 4^1092 == 1 (mod 1093^2), so 1093 is a term of the sequence.
		

Crossrefs

Programs

  • PARI
    forprime(p=1, 1e9, if(Mod(omega(p-1), p^2)^(p-1)==1, print1(p, ", ")))