|
%I #15 Oct 24 2014 13:22:09
%S 1,2,3,4,6,5,8,13,11,7,17,29,24,15,9,38,64,53,33,20,10,84,143,118,73,
%T 44,22,12,187,319,263,163,98,49,26,14,418,713,588,364,219,109,58,31,
%U 16,934,1594,1314,813,489,243,129,69,35,18,2088,3564,2938,1817
%N Dispersion of [n*sqrt(5)], where [ ]=floor, by antidiagonals.
%C 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:
%C (1) s=A000040 (the primes), D=A114537, u=A114538.
%C (2) s=A022343 (without initial 0), D=A035513 (Wythoff array), u=A003603.
%C (3) s=A007067, D=A035506 (Stolarsky array), u=A133299.
%C More recent examples of dispersions: A191426-A191455.
%e Northwest corner:
%e 1...2....4....8...17
%e 3...6....13...29..64
%e 5...11...24...53..118
%e 7...15...33...73..163
%e 9...20...44...98..219
%t (* Program generates the dispersion array T of increasing sequence f[n] *)
%t r=40; r1=12; c=40; c1=12; x = Sqrt[5];
%t f[n_] := Floor[n*x] (* complement of column 1 *)
%t mex[list_] := NestWhile[#1 + 1 &, 1, Union[list][[#1]] <= #1 &, 1, Length[Union[list]]]
%t rows = {NestList[f, 1, c]};
%t Do[rows = Append[rows, NestList[f, mex[Flatten[rows]], r]], {r}];
%t t[i_, j_] := rows[[i, j]];
%t TableForm[Table[t[i, j], {i, 1, 10}, {j, 1, 10}]]
%t (* A191446 array *)
%t Flatten[Table[t[k, n - k + 1], {n, 1, c1}, {k, 1, n}]] (* A191446 sequence *)
%t (* Program by _Peter J. C. Moses_, Jun 01 2011 *)
%Y Cf. A114537, A035513, A035506.
%K nonn,tabl
%O 1,2
%A _Clark Kimberling_, Jun 05 2011
%E Corrected typo in name and fixed Mathematica program by _Vaclav Kotesovec_, Oct 24 2014
|
