cp's OEIS Frontend

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.

A183172 Ordering of the numbers in set S generated by these rules: 1 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).

This page as a plain text file.
%I A183172 #10 May 25 2015 03:55:00
%S A183172 1,3,4,5,7,9,10,12,13,14,16,17,18,19,22,23,24,25,26,30,31,32,33,34,35,
%T A183172 36,40,42,43,44,45,46,47,48,49,50,54,56,58,59,60,61,62,63,64,65,66,67,
%U A183172 69,70,75,76,78,79,81,82,83,84,85,86,87,88,89,90,91,93
%N A183172 Ordering of the numbers in set S generated by these rules: 1 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 A183172 The sequence results from flattening and sorting the tree at A183170.  Complement of A183173, obtained from the tree at A183171.
%H A183172 Ivan Neretin, <a href="/A183172/b183172.txt">Table of n, a(n) for n = 1..10000</a>
%F A183172 See A183170.
%t A183172 nn=100; t={1}; 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 A183172 Cf. A183170, A183173.
%K A183172 nonn
%O A183172 1,2
%A A183172 _Clark Kimberling_, Dec 28 2010