login
Smallest k such that 41^k mod k = n.
9

%I #13 Mar 31 2012 10:22:16

%S 1,2,3,19,37,76,7,17,9,22,31,15,29,77,309,34,7194589,26,23,341,21,55,

%T 799,1658,476983,46,27,427,629,52,142241,138,68889,136,1897,129,30935,

%U 44,19303,1642,34943,43,8858994648397,102,117,436,7715,86,49

%N Smallest k such that 41^k mod k = n.

%t aa = {}; Do[k = 1; While[PowerMod[41, k, k] != n, k++ ]; Print[{n, k}]; AppendTo[aa, k], {n, 1, 50}]; aa

%Y Cf. A036236, A078457, A119678, A119679, A119714-A119716, A127817-A127821, A128154-A128372, A178194-A178202

%K nonn

%O 0,2

%A _Artur Jasinski_, May 23 2010

%E a(0)=1 prepended and a(42) added by _Max Alekseyev_, Feb 04 2012