|
Search: id:A057207
|
|
|
| A057207 |
|
Primes of the form 4k+1 generated recursively: a(1)=5, a(n)= Min{p; p is prime; Mod[p,4]=1; p|1+4Q^2}, where Q is the product of all previous terms in the sequence. |
|
+0
3
|
|
| 5, 101, 1020101, 53, 29, 2507707213238852620996901, 449, 13
(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(4)=53 is the smallest prime divisor of 4*(5.101.1020101)^2+1=1061522231810040101=53*1613*12417062216309
|
|
CROSSREFS
|
Cf. A000945, A000946, A005265, A005266, A051308-A051335, A002144, A057204-A057208.
Sequence in context: A119556 A009765 A113073 this_sequence A124986 A123626 A052138
Adjacent sequences: A057204 A057205 A057206 this_sequence A057208 A057209 A057210
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Oct 09 2000
|
|
|
Search completed in 0.002 seconds
|
