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 A240167 #28 May 02 2021 21:42:28 %S A240167 3,13,103,1009,10099,100189,1000033,10000453,100000123,1000000093, %T A240167 10000000597,100000000069,1000000000189,10000000000279, %U A240167 100000000001173,1000000000000399,10000000000001719,100000000000002733,1000000000000002493,10000000000000000087 %N A240167 Lesser of the first cousin prime pair with n digits. %C A240167 Sum of reciprocals converges towards 0.421066... %C A240167 It is only a (plausible) conjecture that this sequence is well-defined. See A152052. - _N. J. A. Sloane_, Aug 22 2014 %H A240167 Abhiram R Devesh, <a href="/A240167/b240167.txt">Table of n, a(n) for n = 1..100</a> %F A240167 For n > 1, a(n) = 10^(n-1) + A227432(n-1), assuming a(n) exists. - _Jens Kruse Andersen_, Aug 22 2014 %o A240167 (Python) %o A240167 import sympy %o A240167 for i in range(100): %o A240167 a=(10**i) %o A240167 p=sympy.nextprime(a) %o A240167 while not sympy.isprime(p+4): %o A240167 p=sympy.nextprime(p) %o A240167 print(p) %o A240167 (PARI) %o A240167 a(n)=my(p=nextprime(10^(n-1))); while(!isprime(p+4), p=nextprime(p+1)); return(p) %o A240167 vector(50, n, a(n)) \\ _Derek Orr_, Aug 04 2014 %Y A240167 Cf. A023200, A152052, A227432, A240170. %K A240167 nonn,base %O A240167 1,1 %A A240167 _Abhiram R Devesh_, Aug 02 2014