OFFSET
1,2
COMMENTS
Background discussion: Suppose that s is an increasing sequence of positive integers, that the complement t of s is infinite, and that t(1)=1. The dispersion of s is the array D whose n-th row is (t(n), s(t(n)), s(s(t(n))), s(s(s(t(n)))), ...). Every positive integer occurs exactly once in D, so that, as a sequence, D is a permutation of the positive integers. The sequence u given by u(n)=(number of the row of D that contains n) is a fractal sequence. Examples:
EXAMPLE
Northwest corner:
1....2....3....5....9
4....7....12...21...36
6....10...17...29...50
8....14...24...42...73
11...19...33...57...99
MATHEMATICA
(* Program generates the dispersion array T of increasing sequence f[n] *)
r=40; r1=12; c=40; c1=12; x = Sqr[3];
f[n_] := Floor[n*x+1/2] (* complement of column 1 *)
mex[list_] := NestWhile[#1 + 1 &, 1, Union[list][[#1]] <= #1 &, 1, Length[Union[list]]]
rows = {NestList[f, 1, c]};
Do[rows = Append[rows, NestList[f, mex[Flatten[rows]], r]], {r}];
t[i_, j_] := rows[[i, j]];
TableForm[Table[t[i, j], {i, 1, 10}, {j, 1, 10}]]
(* A191442 array *)
Flatten[Table[t[k, n - k + 1], {n, 1, c1}, {k, 1, n}]] (* A191442 sequence *)
(* Program by Peter J. C. Moses, Jun 01 2011 *)
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Clark Kimberling, Jun 04 2011
STATUS
approved