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 A214033 #25 Jan 15 2025 11:48:45 %S A214033 13,17,19,23,37,41,47,67,89,109,137,139,157,181,191,211,229,233,239, %T A214033 257,277,281,283,307,311,331,349,353,359,373,379,397,479,499,503,521, %U A214033 523,547,571,593,599,613,617,619,641 %N A214033 Places n where A214030(n) = n or A214030(n) = n-2. %C A214033 It always has been one of the great mysteries of mathematics, that the superdiagonal sequence of A001177 consists of prime numbers A000057. %C A214033 Here, regarding A214031 and A214032,there is the further conjecture that these two disjoint sequences are primes and roughly comparable in density. It isn't clear that these two sequences have a density, without appealing to the Riemann Hypothesis, but they are certainly close to one another in growing size. %C A214033 Since these two sequences are disjoint, it is natural to take their union. %o A214033 (PARI) %o A214033 {b23(n)=local(t,m=1,s=[n]); if (n<2,0,while(1, %o A214033 if(m%2,s=concat(s,2),s=concat(s,3)); %o A214033 t=contfracpnqn(concat(s,n)); %o A214033 t=contfrac(n*t[1,1]/t[2,1]); %o A214033 if(t[1]<n^2||t[#t]<n^2,m++,break));m)}; %o A214033 \\ To print the sequence a(n) to the screen, %o A214033 for(i=1,500,if(b23(i)==i||b23(i)==i-2, print1(i,", "))); %Y A214033 Cf. A000057, A001177, A214030, A214031, A213032. %K A214033 nonn,more %O A214033 1,1 %A A214033 _Art DuPre_, Jul 12 2012