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 A183169 #7 Jul 12 2012 00:39:52 %S A183169 1,2,4,3,16,6,9,5,256,20,36,8,81,12,25,7,65536,272,400,24,1296,42,64, %T A183169 11,6561,90,144,15,625,30,49,10,4294967296,65792,73984,288,160000,420, %U A183169 576,29,1679616,1332,1764,48,4096,72,121,14 %N A183169 Tree generated by the squares. %C A183169 A permutation of the positive integers. See the comment at A183079 (tree generated by the triangular numbers). The leftmost numbers (1,2,4,16,...) are, after the initial 1, given by A001146. The rightmost numbers (1,2,3,5,7,10,...) are, after the initial 1, the iterates of the nonsquare function; see a comment at A033638. %F A183169 Let L(n) be the n-th square (A000290). %F A183169 Let U(n) be the n-th nonsquare (A000037). %F A183169 The tree-array T(n,k) is then given by rows: %F A183169 T(0,0)=1; T(1,0)=2; %F A183169 T(n,2j)=L(T(n-1),j); %F A183169 T(n,2j+1)=U(T(n-1),j); %F A183169 for j=0,1,...,2^(n-1)-1, n>=2. %e A183169 First levels of the tree: %e A183169 ......................1 %e A183169 ......................2 %e A183169 ...........4.....................3 %e A183169 .......16.......6...........9..........5 %e A183169 ...256...20...36..8......81...12....25...7 %Y A183169 Cf. A183079, A000037, A183169, A001146, A033638. %K A183169 nonn,tabf %O A183169 1,2 %A A183169 _Clark Kimberling_, Dec 28 2010