The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A178199 Smallest k such that 38^k mod k = n. 1

%I

%S 1,37,3,5,6,11,1438,31,9,29,18,45021,13,5249,22,23,20,69,25,437,21,

%T 227643018837677,42,141,50,19877,27,121,36,303,98,49,75,329,94,261,

%U 116,9200543,39,87541720241623,52,1119,1402,510025,356,24829,466,51

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

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

%t sk[n_]:=Module[{k=1},While[PowerMod[38,k,k]!=n,k++];k]; Array[sk,50,0] (* _Harvey P. Dale_, Mar 14 2015 *)

%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 Terms a(21) onward from _Max Alekseyev_, Apr 22 2012

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 July 29 09:41 EDT 2021. Contains 346344 sequences. (Running on oeis4.)