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 A309197 #10 Jul 22 2021 02:12:34 %S A309197 1,3,7,8,15,19,23,31,32,39,48,63,71,83,95,103,111,127,143,147,151,159, %T A309197 167,175,195,199,207,211,215,223,224,255,271,279,287,319,327,343,351, %U A309197 359,367,371,383,391,399,415,431,435,447,463,464,511,543,559,579,583,595,607,639,655,663,687,703 %N A309197 List of numbers k such that A111273(k) reaches the smallest missing number. %H A309197 Rémy Sigrist, <a href="/A309197/b309197.txt">Table of n, a(n) for n = 1..10000</a> %H A309197 Rémy Sigrist, <a href="/A309197/a309197.gp.txt">PARI program for A309197</a> %e A309197 After we reach A111273(8) = 6, the smallest missing number in A111273 is 8 (see A309195). We do not see 8 in A111273 until we reach A111273(15) = 8, so 15 is a term. %o A309197 (PARI) See Links section. %Y A309197 Cf. A111273, A309195, A309196. %K A309197 nonn %O A309197 1,2 %A A309197 _N. J. A. Sloane_, Jul 24 2019