A185092 Numbers k such that j^j == j^j^j (mod k) for every j.

1, 2, 3, 4, 6, 12

Offset

1,2

Comments

Divisors of 12. For k <= 16, we may compute membership directly (see Mathematica code). For k > 16, we have j = 2 as a counterexample. - Eric M. Schmidt, Aug 03 2014

Links

Table of n, a(n) for n=1..6.

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 A335993 A018309

Adjacent sequences: A185089 A185090 A185091 * A185093 A185094 A185095

Keyword

nonn,fini,full

Author

José María Grau Ribas, Jan 23 2012

Status

approved