|
Search: id:A057206
|
|
|
| A057206 |
|
Primes of form 6k+5 generated recursively: a(1)=5; a(n)=Min{p, prime; Mod[p,6]=5; p|6Q-1}, where Q is the product of all previous terms in the sequence. |
|
+0
1
|
|
| 5, 29, 11, 1367, 13082189, 89, 59, 29819952677, 91736008068017, 17, 887050405736870123700827, 688273423680369013308306870159348033807942418302818522537
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
Dirichlet,P.G.L (1871):Vorlesungen uber Zahlentheorie. Braunschweig,Viewig,Supplement VI, 24 pages.
G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. 3rd ed., Oxford Univ. Press, 1954, page 13.
|
|
EXAMPLE
|
a(3)=11 is the smallest prime divisor of the form 6k+5 of 6*(5.29)-1=6Q-1=11.79=869.
|
|
CROSSREFS
|
Cf. A000945, A000946, A005265, A005266, A051308-A051335, A057204-A057208, A007528.
Adjacent sequences: A057203 A057204 A057205 this_sequence A057207 A057208 A057209
Sequence in context: A132550 A083020 A033503 this_sequence A057713 A124987 A002584
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Oct 09 2000
|
|
|
Search completed in 0.002 seconds
|
