[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A125044
Primes of the form 54k+1 generated recursively. Initial prime is 109. General term is a(n) = Min {p is prime; p divides (R^27 - 1)/(R^9 - 1); p == 1 (mod 27)}, where Q is the product of previous terms in the sequence and R = 3*Q.
0
109, 50221, 379, 5077, 2527181639419400128997560106426867837203, 112807, 2094067, 1567, 9325207, 370603, 67447, 27978113462777647321591, 1012771, 163, 396577, 7096357, 3511, 3673, 541, 389287, 1999, 68979565009, 649108891
OFFSET
1,1
COMMENTS
All prime divisors of (R^27 - 1)/(R^9 - 1) different from 3 are congruent to 1 modulo 54.
REFERENCES
M. Ram Murty, Problems in Analytic Number Theory, Springer-Verlag, NY, (2001), p. 209.
EXAMPLE
a(2) = 50221 is the smallest prime divisor congruent to 1 mod 54 of
(R^27-1)/(R^9- 1) = 1827509098737085519727094436535854935801097657 = 50221 * 106219 * 342587871163695447795790279515751543, where Q = 109 and R = 3*Q.
KEYWORD
nonn
AUTHOR
Nick Hobson, Nov 18 2006
EXTENSIONS
More terms from Sean A. Irvine, Dec 11 2011
STATUS
approved