login
Smallest k such that 40^k mod k = n.
1

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

%S 1,3,19,37,6,7,17,11,92,31,15,29,794,21,26,215,22,23,98,49,124,19849,

%T 42,12405874306277,284,75,1574,221,36,323,70,119,56,133,58,685,44,69,

%U 142,187,41,31561,82,3197,148,10073,51,511,176,37603,62,437,86,1339,1546,63,386,12599,138,3017,140,493,1538,529,72,935,118,303,253,277061,95

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

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

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

%K nonn

%O 0,2

%A _Artur Jasinski_, May 23 2010

%E Terms a(23) onward from _Max Alekseyev_, Mar 19 2012