|
Search: id:A124984
|
|
|
| A124984 |
|
Primes of the form 8k+3 generated recursively. Initial prime is 3. General term is a(n)=Min {p is prime; p divides 2+Q^2; Mod[p,8]=3}, where Q is the product of previous terms in the sequence. |
|
+0
19
|
|
| 3, 11, 1091, 1296216011, 2177870960662059587828905091, 76870667, 19, 257680660619, 73677606898727076965233531
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
2+Q^2 always has a prime divisor congruent to 3 modulo 8.
|
|
REFERENCES
|
D. M. Burton, Elementary Number Theory, McGraw-Hill, Sixth Edition (2007), p. 191.
|
|
LINKS
|
N. Hobson, Home page (listed in lieu of email address)
|
|
EXAMPLE
|
a(3) = 1091 is the smallest prime divisor congruent to 3 mod 8
of 2+Q^2 = 1091, where Q = 3 * 11.
|
|
CROSSREFS
|
Cf. A000945, A007520, A057204-A057208, A051308-A051335, A124984-A124993, A125037-A125045.
Sequence in context: A111130 A088579 A145988 this_sequence A034797 A101710 A088799
Adjacent sequences: A124981 A124982 A124983 this_sequence A124985 A124986 A124987
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Nick Hobson Nov 18 2006
|
|
|
Search completed in 0.002 seconds
|
