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 A130011 #32 Apr 17 2016 08:56:55 %S A130011 1,4,5,12,15,16,17,18,19,20,21,36,37,38,45,48,51,54,57,60,63,64,65,66, %T A130011 67,68,69 %N A130011 A self-describing sequence. Pick any integer n in the sequence; this n says: "There are n terms in the sequence that are <= 3n". This sequence is the slowest increasing one with this property. %C A130011 See comments in A094591 and A037988. %C A130011 It is not clear in what sense "slowest increasing" is meant in the description of this sequence. The definition requires that there be exactly a(k) terms <= 3 a(k), for any index k. Therefore, a(n+1) > 3n for all indices n of the form n = a(k). Thus, any such sequence has an infinite number of terms a(k) >= 3k-2. The lexicographically first variant A260107, which starts (1, 4, 5, 6, 13, 16, 19, 20, 21, 22, ...), also has all its terms a(k) <= 3k-2, so it cannot be said to increase faster. - _M. F. Hasler_, Jul 16 2015 %H A130011 <a href="/A130011/b130011.txt">Table of n, a(n) for n = 1..27</a> %K A130011 more,nonn %O A130011 1,2 %A A130011 _Eric Angelini_, Jun 15 2007