OFFSET
1,1
COMMENTS
This is the first of four sequences that partition the positive integers. Suppose that u = (u(n)) and v = (v(n)) are increasing sequences of positive integers. Let u' and v' be their (increasing) complements, and consider these four sequences:
(1) u o v, defined by (u o v)(n) = u(v(n));
(2) u o v';
(3) u' o v;
(4) v' o u'.
EXAMPLE
(1) u o v = (5, 8, 10, 12, 15, 16, 18, 21, 24, 26, 27, 30, 31, 35, 37, 39, ...) = A360398
(2) u o v' = (1, 3, 6, 9, 14, 19, 23, 28, 33, 36, 41, 46, 51, 54, 60, 63, 68, ...) = A360399
(3) u' o v = (7, 13, 20, 22, 29, 32, 34, 40, 47, 49, 53, 58, 62, 67, 74, 76, ...) = A360400
(4) u' o v' = (2, 4, 11, 17, 25, 38, 43, 56, 64, 71, 79, 92, 101, 106, 119, ...) = A360401
MATHEMATICA
z = 2000;
u = Accumulate[1 + ThueMorse /@ Range[0, 600]]; (* A026430 *)
u1 = Complement[Range[Max[u]], u]; (* A356133 *)
v = u + 2; (* A360392 *)
v1 = Complement[Range[Max[v]], v]; (* A360393 *)
zz = 100;
Table[u[[v[[n]]]], {n, 1, zz}] (* A360398 *)
Table[u[[v1[[n]]]], {n, 1, zz}] (* A360399 *)
Table[u1[[v[[n]]]], {n, 1, zz}] (* A360400 *)
Table[u1[[v1[[n]]]], {n, 1, zz}] (* A360401 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Feb 10 2023
STATUS
approved