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!)
 A065908 Second solution mod p of x^4 = 2 for primes p such that only two solutions exist. 3
 5, 15, 16, 30, 56, 76, 55, 123, 135, 133, 158, 152, 125, 147, 195, 208, 197, 281, 214, 226, 324, 403, 307, 364, 401, 445, 377, 310, 574, 641, 701, 492, 677, 609, 602, 444, 636, 854, 791, 511, 599, 852, 690, 623, 786, 914, 769, 698, 692, 1102, 1201, 1073 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Conjecture: no integer occurs more than three times in this sequence. Confirmed for the first 2399 terms of A007522 (primes < 100000). In this section, there are no integers which do occur thrice. LINKS FORMULA a(n) = second (largest) solution mod p of x^4 = 2, where p is the n-th prime such that x^4 = 2 has only two solutions mod p, i.e. p is the n-th term of A007522. EXAMPLE a(3) = 16, since 31 is the third term of A007522 and 16 is the second solution mod 31 of x^4 = 2. PROG (PARI): a065908(m) = local(s); forprime(p = 2, m, s = []; for(x = 0, p-1, if(x^4%p == 2%p, s = concat(s, [x]))); if(matsize(s) == 2, print1(s, ", "))) a065908(1400) CROSSREFS Sequence in context: A030486 A101238 A109161 * A297124 A166503 A231720 Adjacent sequences:  A065905 A065906 A065907 * A065909 A065910 A065911 KEYWORD nonn AUTHOR Klaus Brockhaus, Nov 29 2001 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 August 4 10:00 EDT 2021. Contains 346446 sequences. (Running on oeis4.)