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!)
A240662 Least k such that 7^k == -1 (mod prime(n)), or 0 if no such k exists. 1

%I #4 Apr 15 2014 02:36:23

%S 1,0,2,0,5,6,8,0,11,0,0,0,20,3,0,13,0,30,33,35,12,39,0,44,48,50,0,53,

%T 0,7,63,0,34,0,37,75,26,81,0,86,89,6,5,12,49,0,105,0,0,114,58,119,120,

%U 0,128,131,134,0,69,10,0,146,0,0,52,79,55,28,173,174,16

%N Least k such that 7^k == -1 (mod prime(n)), or 0 if no such k exists.

%C The least k, if it exists, such that prime(n) divides 7^k + 1.

%H T. D. Noe, <a href="/A240662/b240662.txt">Table of n, a(n) for n = 1..1000</a>

%F a(1) = 1; for n > 1, a(n) = A211243(n)/2 if A211243(n) is even, otherwise 0.

%t Table[p = Prime[n]; s = Select[Range[p/2], PowerMod[7, #, p] == p - 1 &, 1]; If[s == {}, 0, s[[1]]], {n, 100}]

%Y Cf. A211243 (order of 7 mod prime(n)).

%K nonn

%O 1,3

%A _T. D. Noe_, Apr 14 2014

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 March 29 09:44 EDT 2024. Contains 371268 sequences. (Running on oeis4.)