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 A065910 #8 Feb 10 2025 14:07:27 %S A065910 25,8,47,71,46,91,158,102,278,294,216,201,355,110,297,283,161,567,490, %T A065910 422,578,250,309,625,344,578,287,151,164,641,736,238,474,763,408,758, %U A065910 406,650,813,1090,1043,771,328,699,902,165,857,1000,553,1148,1434,955 %N A065910 Second solution mod p of x^4 = 2 for primes p such that more than two solution exists. %C A065910 Conjecture: no integer occurs more than three time in this sequence. Confirmed for the first 1182 terms of A014754 (primes < 100000). In this section, there are no integers which do occur thrice. 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 A065910 a(n) = second 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 A065910 a(3) = 47, since 113 is the third term of A014754, 27, 47, 66 and 86 are the solutions mod 113 of x^4 = 2 and 47 is the second one. %o A065910 (PARI) %o A065910 a065910(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[2],","))) %o A065910 a065910(3500) %Y A065910 Cf. A040098, A007522, A014754, A065909, A065911, A065912. %K A065910 nonn %O A065910 1,1 %A A065910 _Klaus Brockhaus_, Nov 29 2001