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.

Showing 1-1 of 1 results.

A178751 Numbers k such that in Z/kZ the equation x^y + 1 = 0 has only the trivial solutions with x == -1 (mod k).

Original entry on oeis.org

2, 3, 4, 6, 8, 12, 15, 16, 20, 24, 30, 32, 40, 48, 51, 60, 64, 68, 80, 96, 102, 120, 128, 136, 160, 192, 204, 240, 255, 256, 272, 320, 340, 384, 408, 480, 510, 512, 544, 640, 680, 768, 771, 816, 960, 1020, 1024, 1028, 1088, 1280, 1360, 1536, 1542, 1632, 1920, 2040
Offset: 1

Views

Author

Arnaud Vernier, Jun 09 2010, Jun 10 2010

Keywords

Comments

It appears that odd terms 3, 15, 51, 255, 771, 3855, 13107, 65535, ... are given by A038192. - Michel Marcus, Aug 08 2013
This is the complement of A126949 in the numbers k > 1. (But it could be argued that the sequence should start with k = 1 as initial term.) It appears that for any a(j) in the sequence, 2*a(j) is also in the sequence. The primitive terms (not of the form a(j) = 2*a(m), m < j) are 2, 3, 15, 20, 51, 68, 255, 340, 771, 1028, .... (see A274003). - M. F. Hasler, Jun 06 2016

Examples

			In Z/3Z, the only solution to the equation x^y + 1 = 0 is x = 2 and y = 1. Whereas in Z/5Z, the equation has at least one nontrivial solution: 2^2 + 1 = 0.
		

Crossrefs

Programs

  • PARI
    is(n)=for(x=2,n-2,if(gcd(x,n)>1,next);my(t=Mod(x,n));while(abs(centerlift(t))>1,t*=x);if(t==-1,return(0)));n>1 \\ Charles R Greathouse IV, Aug 08 2013
Showing 1-1 of 1 results.