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 A079259 #7 Mar 30 2012 17:27:18 %S A079259 1,5,6,10,11,15,19,20,24,25,29,33,34,38,39,43,44,48,49,53,57,58,62,63, %T A079259 67,71,72,76,77,81,82,86,87,91,95,96,100,101,105,109,110,114,115,119, %U A079259 123,124,128,129,133,137,138,142,143,147,148,152,153,157,161,162,166,167,171,175,176,180,181,185,186,190,191,195,199,200,204 %N A079259 a(n) is taken to be the smallest positive integer greater than a(n-1) such that the condition "n is in the sequence if and only if a(n) and a(n+1) are both odd" can be satisfied. %H A079259 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 A079259 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) %Y A079259 Cf. A079000, A079253-A079258. %K A079259 easy,nonn %O A079259 1,2 %A A079259 _N. J. A. Sloane_ and _Matthew Vandermast_, Feb 04 2003