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 A376194 #7 Sep 26 2024 20:24:39 %S A376194 2,3,4,5,5,5,5,7,9,11,11,11,11,11,11,11,11,13,17,19,21,23,23,23,23,23, %T A376194 23,23,23,23,23,23,23,23,23,23,23,23,23,29,31,37,41,43,45,47,47,47,47, %U A376194 47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,47,53,59,61,67,71,73,79,83,85,89 %N A376194 a(n) = smallest number missing from A375564 after A375564(n) has been found. %H A376194 N. J. A. Sloane, <a href="/A376194/b376194.txt">Table of n, a(n) for n = 1..5000</a> %e A376194 A375564 begins 1, 2, 3, 4, 6, 8, 10, 5, 7, 9, 12, ... so the successive smallest missing numbers are 2, 3, 4, 5, 5, 5, 7, 9, 11, 11, 11, ... %Y A376194 Cf. A375564. %K A376194 nonn %O A376194 1,1 %A A376194 _N. J. A. Sloane_, Sep 26 2024