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 A338451 #18 Jul 28 2024 10:38:53 %S A338451 2,3,3,3,5,5,7,7,7,7,11,11,11,11,11,11,11,11,13,13,13,13,13,13,13,13, %T A338451 13,13,13,13,13,13,17,17,17,17,17,19,19,19,19,23,23,23,23,23,23,23,23, %U A338451 23,23,23,23,25,25,25,25,25,25,25,25,25,25,25,25,25,25,29 %N A338451 a(n) is the least positive number that does not appear among the first n terms of A338338. %C A338451 Conjecture: this sequence is unbounded (and A338338 is a permutation of the positive numbers). %H A338451 Rémy Sigrist, <a href="/A338451/b338451.txt">Table of n, a(n) for n = 1..10000</a> %H A338451 Rémy Sigrist, <a href="/A338451/a338451.txt">C program for A338451</a> %e A338451 For n = 3: %e A338451 - A338338(1) = 1, %e A338451 - A338338(2) = 2, %e A338451 - A338338(3) = 4, %e A338451 - the number 3 is the least missing number, %e A338451 - so a(3) = 3. %o A338451 (C) /* See Links section. */ %Y A338451 Cf. A280740, A338338. %K A338451 nonn %O A338451 1,1 %A A338451 _Rémy Sigrist_, Oct 28 2020