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 A099797 #5 Mar 30 2012 17:29:19 %S A099797 2,4,5,6,8,9,11,12,14,17,18,20,23,24,29,31,32,33,37,38,41,43,44,45,47, %T A099797 53,59,61,62,67,68,69,70,71,73,79,80,81,83,89,90,97,98,99,100,101,102, %U A099797 103,107,109,113,127,128,131,137,139,149,151,152,157,158,159,163,167 %N A099797 a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is composite". %H A099797 B. Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="http://www.cs.uwaterloo.ca/journals/JIS/index.html">Numerical analogues of Aronson's sequence</a>, J. Integer Seqs., Vol. 6 (2003), #03.2.2. %H A099797 B. Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="http://arXiv.org/abs/math.NT/0305308">Numerical analogues of Aronson's sequence</a> (math.NT/0305308) %e A099797 a(1) cannot be 1 because 1 is not composite; it can be 2. %Y A099797 Cf. A079000, A079254, A085925, A099798. %K A099797 nonn %O A099797 1,1 %A A099797 _Ray Chandler_, Nov 02 2004