This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A198032 Numbers m such that the number of distinct residues of the congruence x^m  (mod 2m+1) equals 2m+1,  x=0..2m. 1
 0, 1, 7, 17, 19, 25, 27, 43, 47, 55, 57, 59, 61, 71, 77, 79, 91, 93, 97, 101, 107, 109, 117, 127, 133, 143, 145, 147, 149, 151, 159, 161, 163, 167, 169, 177, 185, 195, 197, 199, 203, 205, 207, 223, 227, 235, 241, 257, 259, 263, 267, 271, 275, 277, 289, 291 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS EXAMPLE a(2) = 7 because x^7  == 0, 1,…14  (mod 15) => 2*7+1 = 15 distinct residues. MATHEMATICA lst:={}; Table[If[Length[Union[PowerMod[Range[0, 2*n], n, 2*n+1]]]==2*n+1, AppendTo[lst, n]], {n, 0, 320}]; lst CROSSREFS Cf. A198020, A197930. Sequence in context: A001913 A071845 A084704 * A175901 A140566 A156005 Adjacent sequences:  A198029 A198030 A198031 * A198033 A198034 A198035 KEYWORD nonn AUTHOR Michel Lagneau, Oct 20 2011 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 22 03:34 EDT 2013. Contains 225511 sequences.