cp's OEIS Frontend

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.

A347279 First member p(m) of the m-th twin prime pair such that d(m) < 0 and d(m-1) > 0, with d(k) = k/Integral_{x=2..p(k)} 1/log(x)^2 dx - C, C = 2*A005597 = A114907.

This page as a plain text file.
%I A347279 #8 Aug 30 2021 17:18:25
%S A347279 1371911,1372757,1393919,1417991,1425881,1428671,1429247,1429859,
%T A347279 1430711,1495379,1502687,1503317,1510217,35278601,35280029,35446781,
%U A347279 35463497,35468789,35469779,35472137,45225161,45274751,45276689,45306641,45324551,45336407,45336761,45337517
%N A347279 First member p(m) of the m-th twin prime pair such that d(m) < 0 and d(m-1) > 0, with d(k) = k/Integral_{x=2..p(k)} 1/log(x)^2 dx - C, C = 2*A005597 = A114907.
%C A347279 See A347278 for more information.
%H A347279 Hugo Pfoertner, <a href="/A347279/b347279.txt">Table of n, a(n) for n = 1..12134</a>
%F A347279 A347278(n) < a(n) < A347278(n+1).
%o A347279 (PARI) \\ see A347278 for auxiliary functions halicon and Li.
%o A347279 a347279(nterms,CHL) = {my(n=2,pprev=1,np=0);
%o A347279 forprime(p=11,, if(p%6!=1&&ispseudoprime(p+2), n++; L=Li(2,p); my(x=n/L-CHL); if(x*pprev>0, if(pprev<0,print1(p,", "); np++; if(np>nterms,return)); pprev=-pprev)))};
%o A347279 a347279(10, halicon([0,2]))
%Y A347279 Cf. A001359, A005597, A114907, A347278.
%K A347279 nonn
%O A347279 1,1
%A A347279 _Hugo Pfoertner_, Aug 26 2021