|
Search: id:A034700
|
|
|
| A034700 |
|
a(n) = smallest prime == 1 (mod 4) such that a(n) is a square mod a(i), all i<n. |
|
+0
2
|
|
| 5, 29, 109, 281, 349, 1601, 1889, 5581, 12421, 14389, 16829, 89501, 294761, 471781, 1134389, 2465081, 2708941, 4695809, 9594709, 33660421, 38692009, 75670769, 138202481, 150274469, 517777769
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(n) is also smallest prime == 1 (mod 4) such that a(i) is a square mod a(n), all i<n. Thus each a(i) is a square mod each a(j), i<>j.
|
|
CROSSREFS
|
Cf. A034698.
Sequence in context: A139856 A097345 A097344 this_sequence A057721 A085151 A119494
Adjacent sequences: A034697 A034698 A034699 this_sequence A034701 A034702 A034703
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
E. M. Rains (rains(AT)caltech.edu)
|
|
EXTENSIONS
|
More terms from David W. Wilson (davidwwilson(AT)comcast.net)
|
|
|
Search completed in 0.002 seconds
|
