Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #9 Oct 22 2016 09:45:06
%S 2,19,6,17,218,15,14,13,12,11,86,9249,214,133,69,4084085,106,39,422,
%T 581831,23,5053,38,9237,26,775,46,1253,206,51,82,671,34,617741981,58,
%U 45,202,289,87,6401,185,217,341,3485351,66,2718013,394,111,56,8064317,75
%N a(n) = least k such that the remainder when 21^k is divided by k is n.
%H Robert G. Wilson v, <a href="/A128361/a128361.txt">Table of n, a(n) for n = 1..10000 with -1 for large entries where a(n) has not yet been found</a>
%t t = Table[0, {10000}]; k = 1; While[k < 3000000000, a = PowerMod[21, k, k]; If[a < 10001 && t[[a]] == 0, t[[a]] = k]; k++ ]; t (* _Robert G. Wilson v_, Jun 25 2009 *)
%t lk[n_]:=Module[{k=1},While[PowerMod[21,k,k]!=n,k++];k]; Array[lk,60] (* The program takes a long time to run *) (* _Harvey P. Dale_, Oct 22 2016 *)
%Y Cf. A128362, A128363, A128364, A128365, A128366, A128367, A128368, A128369, A129370, A128371, A128372.
%Y Cf. A036236, A078457, A119678, A119679, A127816, A119715, A119714, A127817, A127818, A127819, A127820, A127821, A128154, A128155, A128156, A128157, A128158, A128159, A128160.
%Y Cf. A128149, A128150, A128172.
%K hard,nonn
%O 1,1
%A _Alexander Adamchuk_, Feb 27 2007
%E a(16) - a(51) from _Robert G. Wilson v_, Jun 25 2009