|
|
A191541
|
|
Dispersion of (2*floor(n*sqrt(2))), by antidiagonals.
|
|
1
|
|
|
1, 2, 3, 4, 8, 5, 10, 22, 14, 6, 28, 62, 38, 16, 7, 78, 174, 106, 44, 18, 9, 220, 492, 298, 124, 50, 24, 11, 622, 1390, 842, 350, 140, 66, 30, 12, 1758, 3930, 2380, 988, 394, 186, 84, 32, 13, 4972, 11114, 6730, 2794, 1114, 526, 236, 90, 36, 15, 14062, 31434
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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:
|
|
LINKS
|
|
|
EXAMPLE
|
Northwest corner:
1...2....4....10...28
3...8....22...62...174
5...14...38...106..298
6...16...44...124..350
7...18...50...140..394
|
|
MATHEMATICA
|
(* Program generates the dispersion array T of the complement of increasing sequence f[n] *)
r=40; r1=12; c=40; c1=12; f[n_] :=2*Floor[n*Sqrt[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}]]
Flatten[Table[t[k, n - k + 1], {n, 1, c1}, {k, 1, n}]] (* A191541 sequence *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|