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”).
%I #39 May 01 2024 13:18:14
%S 2,5,5,17,13,137,8021749,1071065111,1613902553,1797595814863,
%T 633925574060671,22930603692243271
%N Smallest prime starting a sequence of 2n consecutive primes with symmetrical gaps about the center.
%H N. Makarova and others, <a href="http://dxdy.ru/post1035725.html#p1035725">Distributed computing project</a>, discussion at the scientific forum dxdy.ru (in Russian), Feb. 2015.
%H <a href="/index/Pri#gaps">Index entries for primes, gaps between</a>
%F a(n) = A175309(2n-1) (= A055382(n) for n>1). [_M. F. Hasler_, Apr 02 2010]
%F a(n) = A000040(k), where k = least number such that A359440(k+n-1) >= n-1. - _Peter Munn_, Jan 05 2023
%e The first term is 2 since the 2 primes 2, 3 have a gap of 1, which is trivially symmetric about its center.
%e The second term is 5 since the 4 primes 5, 7, 11, 13 have gaps 2, 4, 2, which is symmetric about its center.
%e The twelve primes 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193 have gaps 2, 10, 2, 6, 6, 4, 6, 6, 2, 10, 2 - symmetric about the middle, so a(6) = 137.
%o (PARI) A081235(n) = { my(last=vector(n*=2,i,prime(i)), m, i=Mod(n-2,n)); forprime(p=last[n],default(primelimit), m=last[1+lift(i+2)]+last[1+lift(i++)]=p; for(j=1,n\2,last[1+lift(i-j)]+last[1+lift(i+j+1)]==m||next(2)); return(last[1+lift(i+1)]))} \\ _M. F. Hasler_, Apr 02 2010
%Y Cf. A000040, A001223, A055380, A055381, A175309, A359440.
%Y A variant of A055382.
%K more,nonn
%O 1,1
%A _Christopher Hunt Gribble_ and _T. D. Noe_, Apr 02 2010
%E a(11) from _Dmitry Petukhov_, added by _Max Alekseyev_, Aug 08 2014
%E a(12) from an anonymous participant of the project, added by _Natalia Makarova_, Jul 16 2015