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!)
 A240659 Least k such that 4^k == -1 (mod prime(n)), or 0 if no such k exists. 1
 0, 0, 1, 0, 0, 3, 2, 0, 0, 7, 0, 9, 5, 0, 0, 13, 0, 15, 0, 0, 0, 0, 0, 0, 12, 25, 0, 0, 9, 7, 0, 0, 17, 0, 37, 0, 13, 0, 0, 43, 0, 45, 0, 24, 49, 0, 0, 0, 0, 19, 0, 0, 6, 0, 4, 0, 67, 0, 23, 0, 0, 73, 0, 0, 39, 79, 0, 0, 0, 87, 22, 0, 0, 93, 0, 0, 97, 11, 50, 51 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 COMMENTS The least k, if it exists, such that prime(n) divides 4^k + 1. LINKS T. D. Noe, Table of n, a(n) for n = 1..1000 FORMULA a(n) = A082654(n)/2 if A082654(n) is even, otherwise 0. MATHEMATICA Table[p = Prime[n]; s = Select[Range[p/2], PowerMod[4, #, p] == p - 1 &, 1]; If[s == {}, 0, s[[1]]], {n, 100}] CROSSREFS Cf. A082654 (order of 4 mod prime(n)). Sequence in context: A062707 A160230 A293500 * A246159 A059033 A133209 Adjacent sequences:  A240656 A240657 A240658 * A240660 A240661 A240662 KEYWORD nonn AUTHOR T. D. Noe, Apr 14 2014 STATUS approved

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 25 23:39 EDT 2021. Contains 346294 sequences. (Running on oeis4.)