This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A178194 Smallest k such that 33^k mod k = n. 9
 1, 2, 31, 5, 29, 7, 21, 13, 13684967, 10, 23, 14, 15, 538, 19, 42, 17, 35, 25, 49, 16861, 60, 55, 26, 1157, 38, 511, 54, 30197665, 106, 14691, 46, 155, 37, 18791, 62, 369, 164, 145, 93, 63517, 92, 115, 1046, 3113077, 58, 1376107, 1042, 105, 50, 221 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS smallest k such that m^k mod k = n m=2 see A036236 m=3 see A078457 m=4 see A119678 m=5 see A119679 m=6 see A127816 m=7 see A119715 m=8 see A119714 m=9 see A127817 m=10 see A127818 m=11 see A127819 m=12 see A127820 m=13 see A127821 m=14 see A128154 m=15 see A128155 m=16 see A128156 m=17 see A128157 m=18 see A128158 m=19 see A128159 m=20 see A128160 m=21 see A128361 m=22 see A128362 m=23 see A128363 m=24 see A128364 m=25 see A128365 m=26 see A128366 m=27 see A128367 m=28 see A128368 m=29 see A128369 m=30 see A128370 m=31 see A128371 m=32 see A128372 m=33 see A178194 m=34 see A178195 m=35 see A178196 m=36 see A178197 m=37 see A178198 m=38 see A178199 m=39 see A178200 m=40 see A178201 m=41 see A178202 LINKS MATHEMATICA aa = {}; Do[k = 1; While[PowerMod[33, k, k] != n, k++ ]; Print[k]; AppendTo[aa, k], {n, 0, 50}]; aa CROSSREFS see comment line. Sequence in context: A091776 A159578 A221192 * A069460 A117816 A237263 Adjacent sequences:  A178191 A178192 A178193 * A178195 A178196 A178197 KEYWORD nonn AUTHOR Artur Jasinski, May 22 2010 STATUS approved

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