This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A065909 #11 Feb 10 2025 15:14:48 %S A065909 18,5,27,28,35,46,131,48,252,104,45,123,51,9,69,77,51,177,472,261,55, %T A065909 117,224,562,12,264,273,132,127,500,17,197,107,36,206,671,127,159,137, %U A065909 684,329,564,316,314,197,98,661,925,461,170,930,151,1081,333,434,924 %N A065909 First solution mod p of x^4 = 2 for primes p such that more than two solutions exist. %C A065909 Conjecture: no integer occurs more than three time in this sequence. Confirmed for the first 1182 terms of A014754 (primes < 100000). There are integers which do occur thrice, e.g. 6624. Moreover, no integer is first, second, third or fourth solution for more than three primes. Confirmed for the first 2399 terms of A007522 and the first 1182 terms of A014754 (primes < 100000). %F A065909 a(n) = first (least) solution mod p of x^4 = 2, where p is the n-th prime such that x^4 = 2 has more than two solutions mod p, i.e. p is the n-th term of A014754. %e A065909 a(3) = 27, since 113 is the third term of A014754, 27, 47, 66 and 86 are the solutions mod 113 of x^4 = 2 and 27 is the least one. %o A065909 (PARI) %o A065909 a065909(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]>2,print1(s[1],","))) %o A065909 a065909(4000) %Y A065909 Cf. A040098, A007522, A014754, A065910, A065911, A065912. %K A065909 nonn %O A065909 1,1 %A A065909 _Klaus Brockhaus_, Nov 29 2001 %E A065909 Definition corrected by _Harvey P. Dale_, Apr 16 2015