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^4 = 2 iff i^4 - 2 has a prime factor > i; i is a solution mod p of x^4 = 2 iff p is a prime factor of i^4 - 2 and p > i. i^4 - 2 has at most three prime factors > i. For i such that i^4 - 2 has one resp. two resp. three prime factors > i; cf. A065904 resp. A065905 resp. A065906.
FORMULA
a(n) = n-th integer i such that i^4 - 2 has no prime factor > i.
EXAMPLE
a(2) = 1741, since 1741 is (after 1689) the second integer i for which there are no primes p > i such that i is a solution mod p of x^4 = 2, or equivalently, 1741^4 - 2 = 9187452028559 = 7*7*79*887*1609*1663 has no prime factor > 1741. (cf. A065902).
PROG
(PARI): a065903(m) = local(c, n, f, a); c = 0; n = 2; while(c<m, f = factor(n^4-2); a = matsize(f)[1]; if(f[a, 1]< = n, print1(n, ", "); c++); n++) a065903(40)
CROSSREFS
KEYWORD
nonn
AUTHOR
Klaus Brockhaus, Nov 28 2001
STATUS
approved