login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A178196 Smallest k such that 35^k mod k = n 1

%I #7 May 15 2013 02:05:02

%S 1,2,3,26,31,10,29,14,9,13,55,57,23,92,21,22,19,99,187,134,2105,28,

%T 169,1202,593791,30,27,1198,203,46,695,66,42843,248,4023706859,37,

%U 449467,132,327,1186,565,74,581,394,14277,110,59867,62,1311139,56,75

%N Smallest k such that 35^k mod k = n

%t aa = {}; Do[k = 1; While[PowerMod[35, k, k] != n, k++ ]; Print[k]; AppendTo[aa, k], {n, 0, 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(34) onward from _Max Alekseyev_, Feb 04 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)