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 A087467 #9 May 23 2015 18:46:20 %S A087467 1,1,2,1,2,1,3,2,1,3,2,4,1,3,2,4,1,3,5,2,4,1,3,5,2,4,6,1,3,5,2,4,6,1, %T A087467 3,5,7,2,4,6,1,3,5,7,2,4,6,8,1,3,5,7,2,4,6,8,1,3,5,7,9,2,4,6,8,1,3,5, %U A087467 7,9,2,4,6,8,10,1,3,5,7,9,2,4,6,8,10,1,3,5,7,9,11,2,4,6,8,10,1,3,5,7,9,11,2 %N A087467 a(n) = number of the row (counting from initial row 1) of the array R in A087465 that contains n. %C A087467 A sequence that contains itself as a proper subsequence (infinitely many times); that is, a fractal sequence. %H A087467 Clark Kimberling and John E. Brown, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL7/Kimberling/kimber67.html">Partial Complements and Transposable Dispersions</a>, J. Integer Seqs., Vol. 7, 2004. %F A087467 A087466(n)+1 %e A087467 Northwest corner of R: %e A087467 1 2 4 6 9 %e A087467 3 5 8 11 15 %e A087467 7 10 14 18 23 %e A087467 12 16 21 26 32 %e A087467 19 24 30 36 43 %e A087467 a(10)=3 because 10 is in row 3. %Y A087467 Cf. A087465, A087466. %K A087467 nonn %O A087467 1,3 %A A087467 _Clark Kimberling_, Sep 09 2003