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 A060124 #4 Mar 30 2012 17:27:32 %S A060124 20,34,103,122,136,199,98,221,260,292,214,400,398,409,392,453,509,309, %T A060124 370,720,412,557,513,758,547,462,888,502,724,978,1123,935,1212,1457, %U A060124 1501,1402,1492,1100,1501,1110,1307,1734,1400,1777,835,1680,1555,1868 %N A060124 Third solution mod p of x^3 = 2 for primes p such that more than one solution exists. %C A060124 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. 1501 (cf. A060914). Moreover, no integer occurs more than twice in A060121, A060122, A060123 and A060124 taken together. %F A060124 a(n) = third 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 A060124 a(3) = 103, since 109 is the third term of A014752 and 103 is the third solution mod 109 of x^3 = 2. %Y A060124 Cf. A040028, A014752, A059940, A060914, A060121, A060122, A060123. %K A060124 nonn %O A060124 1,1 %A A060124 _Klaus Brockhaus_, Mar 02 2001