%I #6 Mar 30 2012 18:57:44
%S 1,1,2,1,2,3,1,2,3,4,1,2,3,4,5,6,1,2,3,4,5,6,1,7,2,3,4,5,6,1,7,2,8,3,
%T 4,5,6,1,7,2,8,3,9,4,5,6,1,7,2,8,3,9,4,10,5,6,1,7,2,8,3,9,4,10,5,11,6,
%U 12,1,7,2,8,3,9,4,10,5,11,6,12,1,7,13,2,8,3,9,4,10,5,11,6,12,1,7
%N Triangular array (and fractal sequence): row n is the permutation of (1,2,...,n) obtained from the increasing ordering of fractional parts {r}, {2r}, ..., {nr}, where r=-sqrt(8).
%C See A194832 for a general discussion.
%e First nine rows:
%e 1
%e 1 2
%e 1 2 3
%e 1 2 3 4
%e 1 2 3 4 5
%e 6 1 2 3 4 5
%e 6 1 7 2 3 4 5
%e 6 1 7 2 8 3 4 5
%e 6 1 7 2 8 3 9 4 5
%t r = -Sqrt[8];
%t t[n_] := Table[FractionalPart[k*r], {k, 1, n}];
%t f = Flatten[Table[Flatten[(Position[t[n], #1] &) /@
%t Sort[t[n], Less]], {n, 1, 20}]] (* A194896 *)
%t TableForm[Table[Flatten[(Position[t[n], #1] &) /@
%t Sort[t[n], Less]], {n, 1, 15}]]
%t row[n_] := Position[f, n];
%t u = TableForm[Table[row[n], {n, 1, 20}]]
%t g[n_, k_] := Part[row[n], k];
%t p = Flatten[Table[g[k, n - k + 1], {n, 1, 13},
%t {k, 1, n}]] (* A194897 *)
%t q[n_] := Position[p, n]; Flatten[Table[q[n],
%t {n, 1, 80}]] (* A194898 *)
%Y Cf. A194832, A194897, A194898.
%K nonn,tabl
%O 1,3
%A _Clark Kimberling_, Sep 04 2011
|