login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A196499 Numbers k such that the greatest residue of the congruence x^k (mod k) equals k-1 for x in [0..k-1]. 2
1, 2, 3, 5, 7, 9, 10, 11, 13, 15, 17, 19, 21, 23, 25, 26, 27, 29, 31, 33, 34, 35, 37, 39, 41, 43, 45, 47, 49, 50, 51, 53, 55, 57, 58, 59, 61, 63, 65, 67, 69, 71, 73, 74, 75, 77, 79, 81, 82, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 106, 107, 109, 111 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

All prime numbers are in the sequence.

LINKS

Amiram Eldar, Table of n, a(n) for n = 1..10000

EXAMPLE

50 is in the sequence because the residues of the congruence x^50 (mod 50) are {0, 1, 24, 25, 26, 49} and the greatest value is 50 - 1 = 49.

MATHEMATICA

lst := {}; Do[If[Max[Union[PowerMod[Range[0, n - 1], n, n]]] == n - 1, AppendTo[lst, n]], {n, 120}]; lst

CROSSREFS

Cf. A196082.

Sequence in context: A195921 A175089 A047489 * A035061 A302403 A096738

Adjacent sequences: A196496 A196497 A196498 * A196500 A196501 A196502

KEYWORD

nonn

AUTHOR

Michel Lagneau, Oct 13 2011

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 27 14:41 EST 2022. Contains 358405 sequences. (Running on oeis4.)