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 A183173 #13 May 25 2015 03:55:09
%S A183173 2,6,8,11,15,20,21,27,28,29,37,38,39,41,51,52,53,55,57,68,71,72,73,74,
%T A183173 77,80,92,95,96,99,100,101,103,104,108,113,126,129,130,133,134,135,
%U A183173 139,140,141,142,145,147,152,159,174,177,178,180,182
%N A183173 Ordering of the numbers in set S generated by these rules: 2 is in S, and if n is in S then floor(r*n) and floor(s*n) are in S, where r=sqrt(2) and s=r/(r-1).
%C A183173 The sequence results from flattening and sorting the tree at A183171. Complement of A183172, obtained from the tree at A183170.
%H A183173 Ivan Neretin, <a href="/A183173/b183173.txt">Table of n, a(n) for n = 1..10000</a>
%F A183173 (See A183171, A183172.)
%t A183173 nn=200; t={2}; r=Sqrt[2]; s=r/(r-1); t0=t; While[t=Select[Union[t, Floor[r*t], Floor[s*t]], # <= nn &]; t0 != t, t0=t]; t
%Y A183173 Cf. A183171, A183172.
%K A183173 nonn
%O A183173 1,1
%A A183173 _Clark Kimberling_, Dec 29 2010
%E A183173 Missing term 113 inserted by _John W. Layman_, Dec 29 2010