A022343 -id:A022343 - cp's OEIS frontend

A191455 Dispersion of (floor(n*e)), by antidiagonals.

1, 2, 3, 5, 8, 4, 13, 21, 10, 6, 35, 57, 27, 16, 7, 95, 154, 73, 43, 19, 9, 258, 418, 198, 116, 51, 24, 11, 701, 1136, 538, 315, 138, 65, 29, 12, 1905, 3087, 1462, 856, 375, 176, 78, 32, 14, 5178, 8391, 3974, 2326, 1019, 478, 212, 86, 38, 15, 14075, 22809

Offset: 1

Clark Kimberling, Jun 05 2011

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:
(1) s=A000040 (the primes), D=A114537, u=A114538.
(2) s=A022343 (without initial 0), D=A035513 (Wythoff array), u=A003603.
(3) s=A007067, D=A035506 (Stolarsky array), u=A133299.
More recent examples of dispersions: A191426-A191455.

			Northwest corner:
  1...2....5....13...35
  3...8....21...57...154
  4...10...27...73...198
  6...16...43...116..315
  7...19...51...138..375

Cf. A114537, A035513, A035506.

A191455 := proc(r, c)
    option remember;
    if c = 1 then
        A054385(r) ;
    else
        A022843(procname(r, c-1)) ;
    end if;
end proc: # R. J. Mathar, Jan 25 2015

(* Program generates the dispersion array T of increasing sequence f[n] *)
r=40; r1=12; c=40; c1=12;
f[n_] :=Floor[n*E]   (* 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}]]
(* A191455 array *)
Flatten[Table[t[k, n - k + 1], {n, 1, c1}, {k, 1, n}]] (* A191455 sequence *)
(* Program by Peter J. C. Moses, Jun 01 2011 *)

A191452 Dispersion of (4,8,12,16,...), by antidiagonals.

Original entry on oeis.org

1, 4, 2, 16, 8, 3, 64, 32, 12, 5, 256, 128, 48, 20, 6, 1024, 512, 192, 80, 24, 7, 4096, 2048, 768, 320, 96, 28, 9, 16384, 8192, 3072, 1280, 384, 112, 36, 10, 65536, 32768, 12288, 5120, 1536, 448, 144, 40, 11, 262144, 131072, 49152, 20480, 6144, 1792, 576

Offset: 1

Clark Kimberling, Jun 05 2011

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:
(1) s=A000040 (the primes), D=A114537, u=A114538.
(2) s=A022343 (without initial 0), D=A035513 (Wythoff array), u=A003603.
(3) s=A007067, D=A035506 (Stolarsky array), u=A133299.
More recent examples of dispersions: A191426-A191455.

			Northwest corner:
  1...4....16...64....256
  2...8....32...128...512
  3...12...48...192...768
  5...20...80...320...1280
  6...24...96...384...1536

Ivan Neretin, Table of n, a(n) for n = 1..5050 (first 100 antidiagonals, flattened)

Cf. A114537, A035513, A035506, A191449.

(* Program generates the dispersion array T of increasing sequence f[n] *)
r=40; r1=12; c=40; c1=12;
f[n_] :=4n  (* 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}]]
(* A191452 array *)
Flatten[Table[t[k, n - k + 1], {n, 1, c1}, {k, 1, n}]] (* A191452 sequence *)
(* Program by Peter J. C. Moses, Jun 01 2011 *)

A191449 Dispersion of (3,6,9,12,15,...), by antidiagonals.

Original entry on oeis.org

1, 3, 2, 9, 6, 4, 27, 18, 12, 5, 81, 54, 36, 15, 7, 243, 162, 108, 45, 21, 8, 729, 486, 324, 135, 63, 24, 10, 2187, 1458, 972, 405, 189, 72, 30, 11, 6561, 4374, 2916, 1215, 567, 216, 90, 33, 13, 19683, 13122, 8748, 3645, 1701, 648, 270, 99, 39, 14, 59049

Offset: 1

Clark Kimberling, Jun 05 2011

Transpose of A141396.
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:
(1) s=A000040 (the primes), D=A114537, u=A114538.
(2) s=A022343 (without initial 0), D=A035513 (Wythoff array), u=A003603.
(3) s=A007067, D=A035506 (Stolarsky array), u=A133299.
More recent examples of dispersions: A191426-A191455.

			Northwest corner:
  1...3....9....27...81
  2...6....18...54...162
  4...12...36...108..324
  5...15...45...135..405
  7...21...63...189..567

Cf. A114537, A035513, A035506,
A054582: dispersion of (2,4,6,8,...).
A191450: dispersion of (2,5,8,11,...).
A191451: dispersion of (4,7,10,13,...).
A191452: dispersion of (4,8,12,16,...).

(* Program generates the dispersion array T of increasing sequence f[n] *)
r=40; r1=12; c=40; c1=12;
f[n_] :=3n (* 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}]]
(* A191449 array *)
Flatten[Table[t[k, n - k + 1], {n, 1, c1}, {k, 1, n}]] (* A191449 sequence *)
(* Program by Peter J. C. Moses, Jun 01 2011 *)

T(i,j)=T(i,1)*T(1,j)=floor((3i-1)/2)*3^(j-1).

A191448 Dispersion of the odd integers greater than 1, by antidiagonals.

Original entry on oeis.org

1, 3, 2, 7, 5, 4, 15, 11, 9, 6, 31, 23, 19, 13, 8, 63, 47, 39, 27, 17, 10, 127, 95, 79, 55, 35, 21, 12, 255, 191, 159, 111, 71, 43, 25, 14, 511, 383, 319, 223, 143, 87, 51, 29, 16, 1023, 767, 639, 447, 287, 175, 103, 59, 33, 18, 2047, 1535, 1279, 895, 575

Offset: 1

Clark Kimberling, Jun 05 2011

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:
(1) s=A000040 (the primes), D=A114537, u=A114538.
(2) s=A022343 (without initial 0), D=A035513 (Wythoff array), u=A003603.
(3) s=A007067, D=A035506 (Stolarsky array), u=A133299.
More recent examples of dispersions: A191426-A191455.

			Northwest corner:
  1...3...7...15..31
  2...5...11..23..47
  4...9...19..39..79
  6...13..27..55..111
  8...17..35..71..143

Ivan Neretin, Table of n, a(n) for n = 1..5050 (first 100 antidiagonals, flattened)

Cf. A114537, A035513, A035506.

(* Program generates the dispersion array T of increasing sequence f[n] *)
r=40; r1=12; c=40; c1=12;
f[n_] :=2n+1 (* 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}]]
(* A191448 array *)
Flatten[Table[t[k, n - k + 1], {n, 1, c1}, {k, 1, n}]] (* A191448 sequence *)
(* Program by Peter J. C. Moses, Jun 01 2011 *)

A191545 Dispersion of (floor(9*n/4)), by antidiagonals.

Original entry on oeis.org

1, 2, 3, 4, 6, 5, 9, 13, 11, 7, 20, 29, 24, 15, 8, 45, 65, 54, 33, 18, 10, 101, 146, 121, 74, 40, 22, 12, 227, 328, 272, 166, 90, 49, 27, 14, 510, 738, 612, 373, 202, 110, 60, 31, 16, 1147, 1660, 1377, 839, 454, 247, 135, 69, 36, 17, 2580, 3735, 3098, 1887

Offset: 1

Clark Kimberling, Jun 09 2011

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:
(1) s=A000040 (the primes), D=A114537, u=A114538.
(2) s=A022343 (without initial 0), D=A035513 (Wythoff array), u=A003603.
(3) s=A007067, D=A035506 (Stolarsky array), u=A133299.
More recent examples of dispersions: A191426-A191455.

			Northwest corner:
  1   2    4    9    20
  3   6    13   29   65
  5   11   25   54   121
  7   15   33   74   166
  8   18   40   90   202

Cf. A114537, A035513, A035506.

(* Program generates the dispersion array T of the complement of increasing sequence f[n] *)
r=40; r1=12; c=40; c1=12; f[n_] := Floor[9n/4]   (* 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}]]
(* A191545 array *)
Flatten[Table[t[k, n - k + 1], {n, 1, c1}, {k, 1, n}]] (* A191545 sequence *)
(* Program by Peter J. C. Moses, Jun 01 2011 *)

A191438 Dispersion of ([n*sqrt(2)+n]), where [ ]=floor, by antidiagonals.

Original entry on oeis.org

1, 2, 3, 4, 7, 5, 9, 16, 12, 6, 21, 38, 28, 14, 8, 50, 91, 67, 33, 19, 10, 120, 219, 161, 79, 45, 24, 11, 289, 528, 388, 190, 108, 57, 26, 13, 697, 1274, 936, 458, 260, 137, 62, 31, 15, 1682, 3075, 2259, 1105, 627, 330, 149, 74, 36, 17, 4060, 7423, 5453

Offset: 1

Clark Kimberling, Jun 04 2011

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:
(1) s=A000040 (the primes), D=A114537, u=A114538.
(2) s=A022343 (without initial 0), D=A035513 (Wythoff array), u=A003603.
(3) s=A007067, D=A035506 (Stolarsky array), u=A133299.
More recent examples of dispersions: A191426-A191455.

			Northwest corner:
  1....2....4....9....21
  3....7....16...38...91
  5....12...28...67...161
  6....14...33...79...190
  8....19...45...108..260

Cf. A114537, A035513, A035506, A191438.

(* Program generates the dispersion array T of increasing sequence f[n] *)
r=40; r1=12; c=40; c1=12;  x = Sqr[2];
f[n_] := Floor[n*x+n] (* 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}]]
(* A191438 array *)
Flatten[Table[t[k, n - k + 1], {n, 1, c1}, {k, 1, n}]] (* A191438 sequence *)
(* Program by Peter J. C. Moses, Jun 01 2011 *)

A191536 Dispersion of (3+floor(n*sqrt(2))), by antidiagonals.

Original entry on oeis.org

1, 4, 2, 8, 5, 3, 14, 10, 7, 6, 22, 17, 12, 11, 9, 34, 27, 19, 18, 15, 13, 51, 41, 29, 28, 24, 21, 16, 75, 60, 44, 42, 36, 32, 25, 20, 109, 87, 65, 62, 53, 48, 38, 31, 23, 157, 126, 94, 90, 77, 70, 56, 46, 35, 26, 225, 181, 135, 130, 111, 101, 82, 68, 52, 39

Offset: 1

Clark Kimberling, Jun 06 2011

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:
(1) s=A000040 (the primes), D=A114537, u=A114538.
(2) s=A022343 (without initial 0), D=A035513 (Wythoff array), u=A003603.
(3) s=A007067, D=A035506 (Stolarsky array), u=A133299.
More recent examples of dispersions: A191426-A191455 and A191536-A191545.

			Northwest corner:
  1...4....8....14...22
  2...5....10...17...27
  3...7....12...19...29
  6...11...18...28...42
  9...15...24...36...54

G. C. Greubel, Table of n, a(n) for the first 50 rows, flattened

Cf. A114537, A035513, A035506.

(* Program generates the dispersion array T of the increasing sequence f[n] *)
r=40; r1=12; c=40; c1=12; f[n_] :=3+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, r1}, {j, 1, c1}]]
(* A191536 array *)
Flatten[Table[t[k, n - k + 1], {n, 1, c1}, {k, 1, n}]] (* A191536 sequence *)
(* Program by Peter J. C. Moses, Jun 01 2011 *)

A191442 Dispersion of ([n*sqrt(3)+1/2]), where [ ]=floor, by antidiagonals.

Original entry on oeis.org

1, 2, 4, 3, 7, 6, 5, 12, 10, 8, 9, 21, 17, 14, 11, 16, 36, 29, 24, 19, 13, 28, 62, 50, 42, 33, 23, 15, 48, 107, 87, 73, 57, 40, 26, 18, 83, 185, 151, 126, 99, 69, 45, 31, 20, 144, 320, 262, 218, 171, 120, 78, 54, 35, 22, 249, 554, 454, 378, 296, 208, 135, 94

Offset: 1

Clark Kimberling, Jun 04 2011

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:
(1) s=A000040 (the primes), D=A114537, u=A114538.
(2) s=A022343 (without initial 0), D=A035513 (Wythoff array), u=A003603.
(3) s=A007067, D=A035506 (Stolarsky array), u=A133299.
More recent examples of dispersions: A191426-A191455.

			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

Cf. A114537, A035513, A035506.

(* 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 *)

A191451 Dispersion of (3*n-2), for n>=2, by antidiagonals.

Original entry on oeis.org

1, 4, 2, 13, 7, 3, 40, 22, 10, 5, 121, 67, 31, 16, 6, 364, 202, 94, 49, 19, 8, 1093, 607, 283, 148, 58, 25, 9, 3280, 1822, 850, 445, 175, 76, 28, 11, 9841, 5467, 2551, 1336, 526, 229, 85, 34, 12, 29524, 16402, 7654, 4009, 1579, 688, 256, 103, 37, 14, 88573

Offset: 1

Clark Kimberling, Jun 05 2011

Row 1:  A003462
Row 2:  A060816
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:
(1) s=A000040 (the primes), D=A114537, u=A114538.
(2) s=A022343 (without initial 0), D=A035513 (Wythoff array), u=A003603.
(3) s=A007067, D=A035506 (Stolarsky array), u=A133299.
More recent examples of dispersions: A191426-A191455.

			Northwest corner:
  1...4....13...40...121
  2...7....22...67...202
  3...10...31...94...283
  5...16...49...148..445
  6...19...58...175..526

Cf. A114537, A035513, A035506, A191449.

(* Program generates the dispersion array T of increasing sequence f[n] *)
r=40; r1=12; c=40; c1=12;
f[n_] :=3n+1 (* 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}]]
(* A191451 array *)
Flatten[Table[t[k, n - k + 1], {n, 1, c1}, {k, 1, n}]] (* A191451 sequence *)
(* Program by Peter J. C. Moses, Jun 01 2011 *)

A191429 Dispersion of ([n*sqrt(2)+2]), where [ ]=floor, by antidiagonals.

Original entry on oeis.org

1, 3, 2, 6, 4, 5, 10, 7, 9, 8, 16, 11, 14, 13, 12, 24, 17, 21, 20, 18, 15, 35, 26, 31, 30, 27, 23, 19, 51, 38, 45, 44, 40, 34, 28, 22, 74, 55, 65, 64, 58, 50, 41, 33, 25, 106, 79, 93, 92, 84, 72, 59, 48, 37, 29, 151, 113, 133, 132, 120, 103, 85, 69, 54, 43, 32, 215, 161, 190, 188, 171, 147, 122, 99, 78, 62, 47, 36

Offset: 1

Clark Kimberling, Jun 03 2011

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:
(1) s=A000040 (the primes), D=A114537, u=A114538.
(2) s=A022343 (without initial 0), D=A035513 (Wythoff array), u=A003603.
(3) s=A007067, D=A035506 (Stolarsky array), u=A133299.
More recent examples of dispersions: A191426-A191455.

			Northwest corner:
  1...3...6...10..16
  2...4...7...11..17
  5...9...14..21..31
  8...13..20..30..44
  12..18..27..40..58

Cf. A114537, A035513, A035506.

(* Program generates the dispersion array T of increasing sequence f[n] *)
r = 40; r1 = 12;  (* r=# rows of T to compute, r1=# rows to show *)
c = 40; c1 = 12;   (* c=# cols to compute, c1=# cols to show *)
x = Sqrt[2];
f[n_] := Floor[n*x + 2] (* f(n) is 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]];  (* the array T *)
TableForm[
Table[t[i, j], {i, 1, 10}, {j, 1, 10}]] (* A191429 array *)
Flatten[Table[
  t[k, n - k + 1], {n, 1, c1}, {k, 1, n}]] (* A191429 sequence *)
(* Program by Peter J. C. Moses, Jun 01 2011 *)

cp's OEIS Frontend

A191455 Dispersion of (floor(n*e)), by antidiagonals.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

A191452 Dispersion of (4,8,12,16,...), by antidiagonals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A191449 Dispersion of (3,6,9,12,15,...), by antidiagonals.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A191448 Dispersion of the odd integers greater than 1, by antidiagonals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A191545 Dispersion of (floor(9*n/4)), by antidiagonals.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A191438 Dispersion of ([n*sqrt(2)+n]), where [ ]=floor, by antidiagonals.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A191536 Dispersion of (3+floor(n*sqrt(2))), by antidiagonals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A191442 Dispersion of ([n*sqrt(3)+1/2]), where [ ]=floor, by antidiagonals.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A191451 Dispersion of (3*n-2), for n>=2, by antidiagonals.

Views