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”).

A261149
a(n) = 515486946529943 + (n-1)*30526020494970.
1
515486946529943, 546012967024913, 576538987519883, 607065008014853, 637591028509823, 668117049004793, 698643069499763, 729169089994733, 759695110489703, 790221130984673, 820747151479643, 851273171974613, 881799192469583, 912325212964553, 942851233459523
OFFSET
1,1
COMMENTS
The terms n = 1..24 are prime. This is the longest known sequence of 24 primes in arithmetic progression with minimal end known as of August 10, 2015.
FORMULA
a(n) = 515486946529943 + (n-1)*136831*A002110(9).
G.f.: -x*(484960926034973*x-515486946529943) / (x-1)^2. - Colin Barker, Aug 25 2015
EXAMPLE
a(24) = 515486946529943 + 23*30526020494970 = 1217585417914253 is prime.
MATHEMATICA
Table[515486946529943 + (n - 1) 30526020494970, {n, 1, 20}]
PROG
(Sage) [515486946529943+(n-1)*30526020494970 for n in (1..20)] #
(Magma) [515486946529943+(n-1)*30526020494970: n in [1..20]];
(PARI) Vec(-x*(484960926034973*x-515486946529943)/(x-1)^2 + O(x^40)) \\ Colin Barker, Aug 25 2015
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Marco Ripà, Aug 10 2015
STATUS
approved