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 A218620 #7 Nov 04 2012 21:33:14 %S A218620 7,1,0,2,18,128,443,2666,1353,2706 %N A218620 Least number m to appear exactly n times in A095972. %C A218620 One has n/2 <= A095972(n)+1 <= n, therefore an integer m can appear in A095972 only between indices m and 2m, and this sequence is effectively computable. %K A218620 nonn,more %O A218620 0,1 %A A218620 _M. F. Hasler_, Nov 03 2012