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 A338396 #16 Oct 24 2020 16:51:55 %S A338396 2,3,5,7,11,13,19,31,109,139,149,179,199,229,239,683,739,809,823,907, %T A338396 977,991,1019,1033,1061,1103,1117,1187,1201,1229,1327,1439,1453,1481, %U A338396 1523,1579,1607,1621,1663,1733,1747,1789,4931,4967,5003,5021,5039,5147,5237 %N A338396 The prime numbers in A158923. %C A338396 This sequence is consists of the prime numbers in A158923, in which A158923(m) is the sum of the previous term A158923(m-1) and the average prime gap log(A158923(m-1)) rounded to the nearest integer with A158923(1) = 2. %o A338396 (Python) %o A338396 from sympy import isprime %o A338396 from math import log %o A338396 print(2) %o A338396 a_last = p_last = m = 2 %o A338396 n = 1 %o A338396 while m >= 2: %o A338396 a = a_last + int(log(a_last) + 0.5) %o A338396 if isprime(a) == 1: %o A338396 print(a) %o A338396 n += 1 %o A338396 a_last = a %o A338396 m += 1 %Y A338396 Cf. A000040, A158923. %K A338396 nonn %O A338396 1,1 %A A338396 _Ya-Ping Lu_, Oct 23 2020