|
Search: id:A125037
|
|
|
| A125037 |
|
Primes of the form 26k+1 generated recursively. Initial prime is 53. General term is a(n)=Min {p is prime; p divides (R^13 - 1)/(R - 1); Mod[p,13]=1}, where Q is the product of previous terms in the sequence, and R = 13Q. |
|
+0
19
|
|
| 53, 11462027512399586179504472990060461, 25793, 178907, 131, 5669, 3511, 157, 59021, 13070705295701
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
All prime divisors of (R^13 - 1)/(R - 1) different from 13 are congruent to 1 modulo 26.
|
|
REFERENCES
|
M. Ram Murty, Problems in Analytic Number Theory, Springer-Verlag, NY, (2001), pp. 208-209.
|
|
LINKS
|
N. Hobson, Home page (listed in lieu of email address)
|
|
EXAMPLE
|
a(2) = 11462027512399586179504472990060461 is the smallest
prime divisor congruent to 1 mod 26 of (R^13 - 1)/(R - 1) =
11462027512399586179504472990060461, where Q = 53, and R = 13Q.
|
|
CROSSREFS
|
Cf. A000945, A057204-A057208, A051308-A051335, A124984-A124993, A125037-A125045.
Sequence in context: A104820 A093253 A087530 this_sequence A101365 A022080 A033688
Adjacent sequences: A125034 A125035 A125036 this_sequence A125038 A125039 A125040
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Nick Hobson Nov 18 2006
|
|
|
Search completed in 0.002 seconds
|
