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 A194844 #5 Mar 30 2012 18:57:44
%S A194844 1,1,2,1,2,3,1,2,3,4,5,1,2,3,4,5,1,6,2,3,4,5,1,6,2,7,3,4,5,1,6,2,7,3,
%T A194844 8,4,9,5,1,6,2,7,3,8,4,9,5,1,10,6,2,7,3,8,4,9,5,1,10,6,2,11,7,3,8,4,9,
%U A194844 5,1,10,6,2,11,7,3,12,8,4,13,9,5,1,10,6,2,11,7,3,12,8,4,13,9,5
%N A194844 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(5).
%C A194844 See A194832 for a general discussion.
%e A194844 First nine rows:
%e A194844 1
%e A194844 1 2
%e A194844 1 2 3
%e A194844 1 2 3 4
%e A194844 5 1 2 3 4
%e A194844 5 1 6 2 3 4
%e A194844 5 1 6 2 7 3 4
%e A194844 5 1 6 2 7 3 8 4
%e A194844 9 5 1 6 2 7 3 8 4
%t A194844 r = Sqrt[5];
%t A194844 t[n_] := Table[FractionalPart[k*r], {k, 1, n}];
%t A194844 f = Flatten[Table[Flatten[(Position[t[n], #1] &) /@ Sort[t[n], Less]], {n, 1, 20}]] (* A194844 *)
%t A194844 TableForm[Table[Flatten[(Position[t[n], #1] &) /@ Sort[t[n], Less]], {n, 1, 15}]]
%t A194844 row[n_] := Position[f, n];
%t A194844 u = TableForm[Table[row[n], {n, 1, 20}]]
%t A194844 g[n_, k_] := Part[row[n], k];
%t A194844 p = Flatten[Table[g[k, n - k + 1], {n, 1, 13},
%t A194844 {k, 1, n}]] (* A194845 *)
%t A194844 q[n_] := Position[p, n]; Flatten[
%t A194844 Table[q[n], {n, 1, 80}]] (* A194846 *)
%Y A194844 Cf. A194832, A194845, A194846.
%K A194844 nonn,tabl
%O A194844 1,3
%A A194844 _Clark Kimberling_, Sep 04 2011