This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A195637 Number of distinct residues of k^n (mod n), k=0..n-1. 13
 1, 2, 3, 2, 5, 4, 7, 2, 3, 6, 11, 4, 13, 8, 15, 2, 17, 4, 19, 4, 9, 12, 23, 4, 5, 14, 3, 8, 29, 12, 31, 2, 33, 18, 35, 4, 37, 20, 15, 4, 41, 8, 43, 12, 15, 24, 47, 4, 7, 6, 51, 8, 53, 4, 15, 8, 21, 30, 59, 8, 61, 32, 9, 2, 65, 24, 67, 10, 69, 24, 71, 4, 73 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(n) = n if n prime. LINKS Alois P. Heinz, Table of n, a(n) for n = 1..10000 EXAMPLE a(18) = 4 because k^18 == 0, 1, 9, 10 (mod 18) => 4 distinct residues. MAPLE a:= n-> nops ({seq (k&^n mod n, k=0..n-1)}): seq (a(n), n=1..100); MATHEMATICA Table[Length[Union[PowerMod[Range[0, n - 1], n, n]]], {n, 100}] (* T. D. Noe, Sep 21 2011 *) CROSSREFS Sequence in context: A127433 A055573 A182816 * A181861 A212831 A072969 Adjacent sequences:  A195634 A195635 A195636 * A195638 A195639 A195640 KEYWORD nonn,nice AUTHOR Michel Lagneau, Sep 21 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 18 18:50 EDT 2013. Contains 225423 sequences.