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 A060123 #4 Mar 30 2012 17:27:32 %S A060123 7,32,58,100,116,179,79,181,186,270,130,394,28,34,97,94,73,288,348, %T A060123 407,298,231,381,125,315,458,781,385,425,928,1095,362,1186,992,1046, %U A060123 1053,116,542,1236,425,1129,1259,1344,1553,570,200,1328,1286,888,1433,808 %N A060123 Second solution mod p of x^3 = 2 for primes p such that more than one solution exists. %C A060123 Solutions mod p are represented by integers from 0 to p-1. No integer occurs more than twice in this sequence (cf. comment to A060121). There are integers which do occur twice, e.g. 116, 425 (cf. A060914). Moreover, no integer occurs more than twice in A060121, A060122, A060123 and A060124 taken together. %F A060123 a(n) = second solution mod p of x^3 = 2, where p is the n-th prime such that x^3 = 2 has more than one solution mod p, i.e. p is the n-th term of A014752. %e A060123 a(3) = 58, since 109 is the third term of A014752 and 58 is the second solution mod 109 of x^3 = 2. %Y A060123 Cf. A040028, A014752, A059940, A060914, A060121, A060122, A060124. %K A060123 nonn %O A060123 1,1 %A A060123 _Klaus Brockhaus_, Mar 02 2001