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 A194011 #5 Mar 30 2012 18:57:39 %S A194011 1,3,2,7,4,5,13,8,9,6,21,14,15,10,11,31,22,23,16,17,12,43,32,33,24,25, %T A194011 18,19,57,44,45,34,35,26,27,20,73,58,59,46,47,36,37,28,29,91,74,75,60, %U A194011 61,48,49,38,39,30,111,92,93,76,77,62,63,50,51,40,41,133,112 %N A194011 Natural interspersion of A002061; a rectangular array, by antidiagonals. %C A194011 See A194029 for definitions of natural fractal sequence and natural interspersion. Every positive integer occurs exactly once (and every pair of rows intersperse), so that as a sequence, A194011 is a permutation of the positive integers; its inverse is A194012. %e A194011 Northwest corner: %e A194011 1...3...7...13...21...31 %e A194011 2...4...8...14...22...32 %e A194011 5...9...15..23...33...45 %e A194011 6...10..16..24...34...46 %e A194011 11..17..25..35...47...61 %t A194011 z = 40; %t A194011 c[k_] := k^2 - k + 1 %t A194011 c = Table[c[k], {k, 1, z}] (* A002061 *) %t A194011 f[n_] := If[MemberQ[c, n], 1, 1 + f[n - 1]] %t A194011 f = Table[f[n], {n, 1, 800}] (* A074294 *) %t A194011 r[n_] := Flatten[Position[f, n]] %t A194011 t[n_, k_] := r[n][[k]] %t A194011 TableForm[Table[t[n, k], {n, 1, 8}, {k, 1, 7}]] %t A194011 p = Flatten[Table[t[k, n - k + 1], {n, 1, 16}, {k, 1, n}]] (* A194011 *) %t A194011 q[n_] := Position[p, n]; Flatten[Table[q[n], {n, 1, 80}]] (* A194012 *) %Y A194011 Cf. A194029, A002061, A074294, A194012. %K A194011 nonn,tabl %O A194011 1,2 %A A194011 _Clark Kimberling_, Aug 15 2011