This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A185092 Numbers n such that i^i = i^i^i (mod n) for every i. 0
 1, 2, 3, 4, 6, 12 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Divisors of 12. For n <= 16, we may compute membership directly (see Mathematica code). For n > 16, we have i = 2 as a counterexample. - Eric M. Schmidt, Aug 03 2014 LINKS MATHEMATICA h1[mod_] := Table[PowerMod[i, i, mod], {i, 1, mod + LCM[mod*CarmichaelLambda[mod]]}]; h2[mod_] := Table[PowerMod[i, i^i, mod], {i, 1, mod + LCM[mod*CarmichaelLambda[mod]]}]; Union[Table[If[h1[i] == h2[i], Print[i]; i], {i, 1000}]] CROSSREFS Sequence in context: A003099 A061941 A029505 * A218337 A018309 A245481 Adjacent sequences:  A185089 A185090 A185091 * A185093 A185094 A185095 KEYWORD nonn,fini,full AUTHOR José María Grau Ribas, Jan 23 2012 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 23 10:55 EDT 2019. Contains 321424 sequences. (Running on oeis4.)