This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A079953 #25 May 03 2021 07:05:39
%S A079953 2,2,3,5,7,7,11,11,13,17,17,19,23,23,29,29,31,31,37,37,37,41,43,47,53,
%T A079953 53,53,59,59,59,67,67,71,71,79,79,79,83,89,89,97,97,97,97,101,101,107,
%U A079953 113,127,127,127,127,127,127,131,137,137,137,139,149,149,149,157,157
%N A079953 Smallest prime p such that prime(n) mod 2*p = prime(n).
%C A079953 a(n) is smallest prime greater than prime(n)/2. - _Peter Munn_, Sep 18 2017
%H A079953 Charles R Greathouse IV, <a href="/A079953/b079953.txt">Table of n, a(n) for n = 1..10000</a>
%F A079953 T(n, A049084(a(n))) = A000040(n), T defined as in A079950.
%F A079953 a(n) = nextprime(prime(n)/2) ~ (n log n)/2. - _Charles R Greathouse IV_, Mar 17 2015
%F A079953 Conjecture: a(n) = A039734(n), n>=2. - _R. J. Mathar_, May 03 2021
%e A079953 n=6: prime(6)=13 and 13 mod(2*2)=1, 13 mod(2*3)=1, 13 mod(2*5)=3, 13 mod(2*7)=13, therefore a(6)=7.
%t A079953 f[n_] := Block[{p = 2}, While[Prime@ n != Mod[Prime@ n, 2 p], p = NextPrime@ p]; p]; Array[f, 64] (* _Michael De Vlieger_, Mar 17 2015 *)
%o A079953 (PARI) a(n,q=prime(n))=nextprime(q/2) \\ _Charles R Greathouse IV_, Mar 17 2015
%Y A079953 Cf. A079952, A039734.
%K A079953 nonn,easy
%O A079953 1,1
%A A079953 _Reinhard Zumkeller_, Jan 19 2003