The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A060914 Integers i > 1 for which there are two primes p such that i is a solution mod p of x^3 = 2. 5
 7, 16, 20, 21, 26, 32, 34, 45, 49, 50, 52, 54, 57, 58, 61, 70, 72, 79, 81, 86, 92, 94, 98, 103, 111, 112, 114, 116, 119, 122, 125, 130, 136, 137, 141, 143, 147, 152, 157, 160, 170, 176, 179, 181, 184, 186, 197, 198, 199, 214, 221, 222, 225, 231, 234, 236, 240 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Solutions mod p are represented by integers from 0 to p - 1. The following equivalences holds for i > 1: There is a prime p such that i is a solution mod p of x^3 = 2 iff i^3 - 2 has a prime factor > i; i is a solution mod p of x^3 = 2 iff p is a prime factor of i^3 - 2 and p > i. i^3 - 2 has at most two prime factors > i. For i such that i^3 - 2 has no prime factors > i; cf. A060591. LINKS FORMULA a(n) = n-th integer i such that i^3 - 2 has two prime factors > i. EXAMPLE a(3) = 20, since 20 is (after 7 and 16) the third integer i for which there are two primes p > i (viz. 31 and 43) such that i is a solution mod p of x^3 = 2, or equivalently, 20^3 - 2 = 7998 = 2*3*31*43 has two prime factors > 20. (cf. A059940). CROSSREFS Sequence in context: A101073 A026226 A335569 * A242917 A044059 A287369 Adjacent sequences:  A060911 A060912 A060913 * A060915 A060916 A060917 KEYWORD nonn AUTHOR Klaus Brockhaus, Apr 08 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 26 20:34 EDT 2021. Contains 347672 sequences. (Running on oeis4.)