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

A261151
a(n) = 11410337850553 + (n-1)*4609098694200.
1
11410337850553, 11871247719973, 12332157589393, 12793067458813, 13253977328233, 13714887197653, 14175797067073, 14636706936493, 15097616805913, 15558526675333, 16019436544753, 16480346414173, 16941256283593, 17402166153013, 17863076022433, 18323985891853
OFFSET
1,1
COMMENTS
The terms n = 1..22 are prime. This is the longest known sequence of 22 primes in arithmetic progression with minimal end known as of August 10, 2015.
FORMULA
a(n) = 11410337850553 + (n-1)*475180*A002110(8).
G.f.: -x*(10949427981133*x-11410337850553) / (x-1)^2. - Colin Barker, Aug 25 2015
EXAMPLE
a(22) = 11410337850553 + 21*4609098694200 = 108201410428753 is prime.
MATHEMATICA
Table[11410337850553 + (n - 1) 4609098694200, {n, 1, 20}]
PROG
(Sage) [11410337850553+(n-1)*4609098694200 for n in (1..20)]
(Magma) [11410337850553+(n-1)*4609098694200: n in [1..20]];
(PARI) Vec(-x*(10949427981133*x-11410337850553) / (x-1)^2 + O(x^40)) \\ Colin Barker, Aug 25 2015
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Marco Ripà, Aug 10 2015
STATUS
approved