This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A060124 Third solution mod p of x^3 = 2 for primes p such that more than one solution exists. 6
 20, 34, 103, 122, 136, 199, 98, 221, 260, 292, 214, 400, 398, 409, 392, 453, 509, 309, 370, 720, 412, 557, 513, 758, 547, 462, 888, 502, 724, 978, 1123, 935, 1212, 1457, 1501, 1402, 1492, 1100, 1501, 1110, 1307, 1734, 1400, 1777, 835, 1680, 1555, 1868 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS 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. LINKS FORMULA 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. EXAMPLE a(3) = 103, since 109 is the third term of A014752 and 103 is the third solution mod 109 of x^3 = 2. CROSSREFS Cf. A040028, A014752, A059940, A060914, A060121, A060122, A060123. Sequence in context: A043166 A043946 A160937 * A068476 A003895 A157426 Adjacent sequences:  A060121 A060122 A060123 * A060125 A060126 A060127 KEYWORD nonn AUTHOR Klaus Brockhaus, Mar 02 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .