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.

A194833 Rectangular array, by antidiagonals: row n gives the positions of n in the fractal sequence A194832; an interspersion.

This page as a plain text file.
%I A194833 #6 Mar 30 2012 18:57:44
%S A194833 1,2,3,5,6,4,8,10,7,9,12,14,11,13,15,18,20,16,19,21,17,24,27,22,25,28,
%T A194833 23,26,32,35,30,33,36,31,34,29,40,44,38,42,45,39,43,37,41,49,53,47,51,
%U A194833 55,48,52,46,50,54,60,64,57,62,66,59,63,56,61,65,58,71,76,68
%N A194833 Rectangular array, by antidiagonals: row n gives the positions of n in the fractal sequence A194832; an interspersion.
%C A194833 As a sequence, A194833 is a permutation of the positive integers; its inverse is A194834.
%e A194833 Northwest corner:
%e A194833 1...2...5...8...12..18..24
%e A194833 3...6...10..14..20..27..35
%e A194833 4...7...11..16..22..30..38
%e A194833 9...13..19..25..33..42..51
%e A194833 15..21..28..36..45..55..66
%t A194833 r = -GoldenRatio;
%t A194833 t[n_] := Table[FractionalPart[k*r], {k, 1, n}];
%t A194833 f = Flatten[Table[Flatten[(Position[t[n], #1] &) /@ Sort[t[n], Less]], {n, 1, 20}]]
%t A194833 (* A194832 *)
%t A194833 TableForm[Table[Flatten[(Position[t[n], #1] &) /@ Sort[t[n], Less]], {n, 1, 15}]]
%t A194833 row[n_] := Position[f, n];
%t A194833 u = TableForm[Table[row[n], {n, 1, 20}]]
%t A194833 g[n_, k_] := Part[row[n], k];
%t A194833 p = Flatten[Table[g[k, n - k + 1], {n, 1, 13}, {k, 1, n}]] (* A194833 *)
%t A194833 q[n_] := Position[p, n]; Flatten[Table[q[n], {n, 1, 80}]] (* A194834 *)
%Y A194833 Cf. A194832, A194834.
%K A194833 nonn,tabl
%O A194833 1,2
%A A194833 _Clark Kimberling_, Sep 03 2011