A026530 -id:A026530 - cp's OEIS frontend

A360136 a(n) = 1 + A026430(A026430(n)).

2, 6, 9, 10, 13, 15, 16, 19, 22, 24, 25, 28, 29, 32, 36, 37, 40, 42, 43, 46, 47, 51, 53, 55, 56, 60, 62, 64, 67, 69, 70, 73, 76, 78, 79, 82, 83, 87, 89, 91, 92, 96, 99, 100, 103, 104, 106, 109, 110, 114, 117, 118, 121, 122, 124, 127, 130, 131, 133, 136, 137

Offset: 1

Clark Kimberling, Feb 03 2023

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) v o u, defined by (v o u)(n)  = v(u(n));
(2) v' o u;
(3) v o u';
(4) v' o u.
Every positive integer is in exactly one of the four sequences. Their limiting densities are 4/9, 2/9, 2/9, 1/9, respectively.

			(1)  v o u = (2, 6, 9, 10, 13, 15, 16, 19, 22, 24, 25, 28, 29, 32, 36, ...) = A360136
(2)  v' o u = (1, 5, 12, 14, 21, 23, 26, 33, 39, 41, 44, 50, 54, 59, 65, ...) = A360137
(3)  v o u' = (4, 7, 11, 17, 20, 27, 31, 34, 38, 45, 49, 52, 58, 61, 66, ...) = A360138
(4)  v' o u' = (3, 8, 18, 30, 35, 48, 57, 63, 72, 84, 93, 98, 111, 116, ...) = A360139

Cf. A026530, A359352, A285953, A359277 (intersections instead of results of composition), A359352-A360135, A360137-A360139.

z = 2000; zz = 100;
u = Accumulate[1 + ThueMorse /@ Range[0, 600]]; (* A026430 *)
u1 = Complement[Range[Max[u]], u];  (* A356133 *)
v = u + 1;  (* A285954 *)
v1 = Complement[Range[Max[v]], v];   (* A285953 *)
Table[v[[u[[n]]]], {n, 1, zz}]       (* A360136 *)
Table[v1[[u[[n]]]], {n, 1, zz}]      (* A360137 *)
Table[v[[u1[[n]]]], {n, 1, zz}]      (* A360138 *)
Table[v1[[u1[[n]]]], {n, 1, zz}]     (* A360139 *)

def A360136(n): return 1+(m:=n+(n-1>>1)+(n-1&1|(n.bit_count()&1^1)))+(m-1>>1)+(m-1&1|(m.bit_count()&1^1)) # Chai Wah Wu, Mar 01 2023

A359353 a(n) = A026430(A285953(n+1)).

Original entry on oeis.org

1, 5, 8, 12, 18, 21, 27, 31, 35, 39, 45, 50, 52, 59, 61, 66, 72, 75, 81, 86, 88, 95, 98, 102, 108, 113, 116, 120, 126, 129, 135, 139, 143, 147, 153, 158, 160, 167, 170, 174, 180, 185, 188, 192, 198, 201, 207, 212, 214, 221, 224, 228, 234, 237, 243, 248, 250

Offset: 1

Clark Kimberling, Jan 30 2023

This is the second 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'.
Every positive integer is in exactly one of the four sequences. Their limiting densities are 4/9, 2/9, 2/9, 1/9, respectively.

			(1) u o v = (3, 6, 9, 10, 14, 15, 16, 19, 23, 24, 26, 28, 30, 33, 36, 37, 41, ...) = A359352
(2) u o v' = (1, 5, 8, 12, 18, 21, 27, 31, 35, 39, 45, 50, 52, 59, 61, 66, 72, ...) = A359353
(3) u' o v = (4, 11, 17, 20, 25, 29, 32, 38, 43, 47, 49, 56, 58, 64, 71, 74, ...) = A360134
(4) u' o v' = (2, 7, 13, 22, 34, 40, 53, 62, 67, 76, 89, 97, 104, 115, 122, ...) = A360135

Cf. A026530, A359352, A285953, A285954, A359277 (intersections instead of results of composition), A359352, A360134-A360139.

z = 2000; zz = 100;
u = Accumulate[1 + ThueMorse /@ Range[0, 600]]; (* A026430 *)
u1 = Complement[Range[Max[u]], u];  (* A356133 *)
v = u + 1;  (* A285954 *)
v1 = Complement[Range[Max[v]], v];  (* A285953 *)
Table[u[[v[[n]]]], {n, 1, zz}]      (* A359352 *)
Table[u[[v1[[n]]]], {n, 1, zz}]     (* A359353 *)
Table[u1[[v[[n]]]], {n, 1, zz}]     (* A360134 *)
Table[u1[[v1[[n]]]], {n, 1, zz}]    (* A360135 *)

A360134 a(n) = A356133(1 + A026430(n)).

Original entry on oeis.org

4, 11, 17, 20, 25, 29, 32, 38, 43, 47, 49, 56, 58, 64, 71, 74, 79, 83, 85, 92, 94, 101, 106, 110, 112, 119, 124, 127, 133, 137, 140, 146, 151, 155, 157, 164, 166, 173, 178, 182, 184, 191, 197, 200, 206, 208, 211, 218, 220, 227, 233, 236, 242, 244, 247, 253

Offset: 1

Clark Kimberling, Jan 30 2023

This is the third 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'.
Every positive integer is in exactly one of the four sequences. Their limiting densities are 4/9, 2/9, 2/9, 1/9, respectively.

			(1) u o v = (3, 6, 9, 10, 14, 15, 16, 19, 23, 24, 26, 28, 30, 33, 36, 37, 41, ...) = A359352
(2) u o v' = (1, 5, 8, 12, 18, 21, 27, 31, 35, 39, 45, 50, 52, 59, 61, 66, 72, ...) = A359353
(3) u' o v = (4, 11, 17, 20, 25, 29, 32, 38, 43, 47, 49, 56, 58, 64, 71, 74, ...) = A360134
(4) u' o v' = (2, 7, 13, 22, 34, 40, 53, 62, 67, 76, 89, 97, 104, 115, 122, ...) = A360135

Cf. A026530, A359352, A285953, A285954, A359277 (intersections instead of results of composition), A359352, A359353, A360135-A360139.

z = 2000; zz = 100;
u = Accumulate[1 + ThueMorse /@ Range[0, 600]]; (* A026430 *)
u1 = Complement[Range[Max[u]], u];  (* A356133 *)
v = u + 1;  (* A285954 *)
v1 = Complement[Range[Max[v]], v];  (* A285953 *)
Table[u[[v[[n]]]], {n, 1, zz}]      (* A359352 *)
Table[u[[v1[[n]]]], {n, 1, zz}]     (* A359353 *)
Table[u1[[v[[n]]]], {n, 1, zz}]     (* A360134 *)
Table[u1[[v1[[n]]]], {n, 1, zz}]    (* A360135 *)

def A360134(n): return 3*(m:=n+1+(n-1>>1)+(n-1&1|(n.bit_count()&1^1)))-(2 if (m-1).bit_count()&1 else 1) # Chai Wah Wu, Mar 01 2023

A360137 a(n) = V(A026430(n)), where V(1) = 1 and V(k) = A285953(k+1) for k >= 2.

Original entry on oeis.org

1, 5, 12, 14, 21, 23, 26, 33, 39, 41, 44, 50, 54, 59, 65, 68, 75, 77, 80, 86, 90, 95, 102, 105, 107, 113, 120, 123, 128, 132, 134, 141, 147, 149, 152, 158, 162, 167, 174, 177, 179, 185, 192, 194, 201, 203, 207, 212, 216, 221, 228, 230, 237, 239, 243, 248

Offset: 1

Clark Kimberling, Feb 03 2023

This is the second 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) v o u, defined by (v o u)(n)  = v(u(n));
(2) v' o u;
(3) v o u';
(4) v' o u.
Every positive integer is in exactly one of the four sequences. Their limiting densities are 4/9, 2/9, 2/9, 1/9, respectively.

			(1)  v o u = (2, 6, 9, 10, 13, 15, 16, 19, 22, 24, 25, 28, 29, 32, 36, ...) = A360136
(2)  v' o u = (1, 5, 12, 14, 21, 23, 26, 33, 39, 41, 44, 50, 54, 59, 65, ...) = A360137
(3)  v o u' = (4, 7, 11, 17, 20, 27, 31, 34, 38, 45, 49, 52, 58, 61, 66, ...) = A360138
(4)  v' o u' = (3, 8, 18, 30, 35, 48, 57, 63, 72, 84, 93, 98, 111, 116, ...) = A360139

Cf. A026530, A359352, A285953, A359277 (intersections instead of results of composition), A359352-A360136, A360138-A360139.

z = 2000; zz = 100;
u = Accumulate[1 + ThueMorse /@ Range[0, 600]]; (* A026430 *)
u1 = Complement[Range[Max[u]], u];  (* A356133 *)
v = u + 1;  (* A285954 *)
v1 = Complement[Range[Max[v]], v];  (* A285953 *)
Table[v[[u[[n]]]], {n, 1, zz}]      (* A360136 *)
Table[v1[[u[[n]]]], {n, 1, zz}]     (* A360137 *)
Table[v[[u1[[n]]]], {n, 1, zz}]     (* A360138 *)
Table[v1[[u1[[n]]]], {n, 1, zz}]    (* A360139 *)

A360138 a(n) = 1 + A026430(A356133(n)).

Original entry on oeis.org

4, 7, 11, 17, 20, 27, 31, 34, 38, 45, 49, 52, 58, 61, 66, 71, 74, 81, 85, 88, 94, 97, 101, 108, 112, 115, 119, 126, 129, 135, 139, 142, 146, 153, 157, 160, 166, 169, 173, 180, 184, 187, 191, 197, 200, 206, 211, 214, 220, 223, 227, 233, 236, 242, 247, 250

Offset: 1

Clark Kimberling, Feb 03 2023

This is the third 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) v o u, defined by (v o u)(n)  = v(u(n));
(2) v' o u;
(3) v o u';
(4) v' o u.
Every positive integer is in exactly one of the four sequences. Their limiting densities are 4/9, 2/9, 2/9, 1/9, respectively.

			(1)  v o u = (2, 6, 9, 10, 13, 15, 16, 19, 22, 24, 25, 28, 29, 32, 36, ...) = A360136
(2)  v' o u = (1, 5, 12, 14, 21, 23, 26, 33, 39, 41, 44, 50, 54, 59, 65, ...) = A360137
(3)  v o u' = (4, 7, 11, 17, 20, 27, 31, 34, 38, 45, 49, 52, 58, 61, 66, ...) = A360138
(4)  v' o u' = (3, 8, 18, 30, 35, 48, 57, 63, 72, 84, 93, 98, 111, 116, ...) = A360139

Cf. A026530, A359352, A285953, A359277 (intersections instead of results of composition), A359352-A360136, A360138-A360139.

z = 2000; zz = 100;
u = Accumulate[1 + ThueMorse /@ Range[0, 600]]; (* A026430 *)
u1 = Complement[Range[Max[u]], u];  (* A356133 *)
v = u + 1;  (* A285954 *)
v1 = Complement[Range[Max[v]], v];  (* A285953 *)
Table[v[[u[[n]]]], {n, 1, zz}]      (* A360136 *)
Table[v1[[u[[n]]]], {n, 1, zz}]     (* A360137 *)
Table[v[[u1[[n]]]], {n, 1, zz}]     (* A360138 *)
Table[v1[[u1[[n]]]], {n, 1, zz}]    (* A360139 *)

def A360138(n): return (m:=3*n-(2 if (n-1).bit_count()&1 else 1))+(m-1>>1)+(m-1&1|(m.bit_count()&1^1))+1 # Chai Wah Wu, Mar 01 2023

A360395 Intersection of A026430 and A360394.

Original entry on oeis.org

1, 6, 9, 15, 19, 24, 27, 31, 36, 42, 45, 51, 55, 60, 66, 69, 73, 78, 81, 87, 91, 96, 99, 103, 108, 114, 117, 121, 126, 129, 135, 139, 144, 150, 153, 159, 163, 168, 171, 175, 180, 186, 189, 195, 199, 204, 210, 213, 217, 222, 225, 231, 235, 240, 246, 249, 255

Offset: 1

Clark Kimberling, Feb 05 2023

This is the second of four sequences that partition the positive integers. Starting with a general overview, suppose that u = (u(n)) and v = (v(n)) are increasing sequences of positive integers.  Let u' and v' be their complements, and assume that the following four sequences are infinite:
(1)  u ^ v = intersection of u and v (in increasing order);
(2)  u ^ v';
(3)  u' ^ v;
(4)  u' ^ v'.
Every positive integer is in exactly one of the four sequences. The limiting densities of these four sequences are 4/9, 2/9, 2/9, and 1/9, respectively.
For A360395, u, v, u', v', are sequences obtained from the Thue-Morse sequence, A026430, as follows:
u = A026530 = (1,3,5,6,8,9,10, 12, ... ) = partial sums of A026430
u' = A356133 = (2,4,7,11,13,17, 20, ... ) = complement of u
v = u + 1 = A285954, except its initial 1
v' = complement of v.

			(1)  u ^ v = (3, 5, 8, 10, 12, 14, 16, 18, 21, 23, 26, 28, 30, 33, ...) =  A360394
(2)  u ^ v' = (1, 6, 9, 15, 19, 24, 27, 31, 36, 42, 45, 51, 55, 60, ...) =  A360395
(3)  u' ^ v = (7, 11, 17, 20, 25, 29, 32, 38, 43, 47, 53, 56, 62, ...) = A360396
(4)  u' ^ v' = (2, 4, 13, 22, 34, 40, 49, 58, 64, 76, 85, 94, 106, ...) = A360397

Cf. A026430, A356133, A360392-A360394, A360396-A360405.

z = 400;
u = Accumulate[1 + ThueMorse /@ Range[0, z]];   (* A026430 *)
u1 = Complement[Range[Max[u]], u];  (* A356133 *)
v = u + 2 ; (* A360392 *)
v1 = Complement[Range[Max[v]], v];  (* A360393 *)
Intersection[u, v]    (* A360394 *)
Intersection[u, v1]   (* A360395 *)
Intersection[u1, v]   (* A360396 *)
Intersection[u1, v1]  (* A360397 *)

A360396 Intersection of A356133 and A360392.

Original entry on oeis.org

7, 11, 17, 20, 25, 29, 32, 38, 43, 47, 53, 56, 62, 67, 71, 74, 79, 83, 89, 92, 97, 101, 104, 110, 115, 119, 122, 127, 131, 137, 140, 146, 151, 155, 161, 164, 169, 173, 176, 182, 187, 191, 197, 200, 206, 211, 215, 218, 223, 227, 233, 236, 242, 247, 251, 257

Offset: 1

Clark Kimberling, Feb 05 2023

This is the third of four sequences that partition the positive integers. Starting with a general overview, suppose that u = (u(n)) and v = (v(n)) are increasing sequences of positive integers.  Let u' and v' be their complements, and assume that the following four sequences are infinite:
(1)  u ^ v = intersection of u and v (in increasing order);
(2)  u ^ v';
(3)  u' ^ v;
(4)  u' ^ v'.
Every positive integer is in exactly one of the four sequences. The limiting densities of these four sequences are 4/9, 2/9, 2/9, and 1/9, respectively.
For A360396, u, v, u', v', are sequences obtained from the Thue-Morse sequence, A026430, as follows:
u = A026530 = (1,3,5,6,8,9,10, 12, ... ) = partial sums of A026430
u' = A356133 = (2,4,7,11,13,17, 20, ... ) = complement of u
v = u + 1 = A285954, except its initial 1
v' = complement of v.

			(1)  u ^ v = (3, 5, 8, 10, 12, 14, 16, 18, 21, 23, 26, 28, 30, 33, ...) =  A360394
(2)  u ^ v' = (1, 6, 9, 15, 19, 24, 27, 31, 36, 42, 45, 51, 55, 60, ...) =  A360395
(3)  u' ^ v = (7, 11, 17, 20, 25, 29, 32, 38, 43, 47, 53, 56, 62, ...) = A360396
(4)  u' ^ v' = (2, 4, 13, 22, 34, 40, 49, 58, 64, 76, 85, 94, 106, ...) = A360397

Cf. A026430, A356133, A360392-A360395, A360397-A360405.

z = 400;
u = Accumulate[1 + ThueMorse /@ Range[0, z]];   (* A026430 *)
u1 = Complement[Range[Max[u]], u];  (* A356133 *)
v = u + 2 ; (* A360392 *)
v1 = Complement[Range[Max[v]], v];  (* A360393 *)
Intersection[u, v]    (* A360394 *)
Intersection[u, v1]   (* A360395 *)
Intersection[u1, v]   (* A360396 *)
Intersection[u1, v1]  (* A360397 *)

A360399 a(n) = A026430(1 + A360393(n)).

Original entry on oeis.org

1, 3, 6, 9, 14, 19, 23, 28, 33, 36, 41, 46, 51, 54, 60, 63, 68, 73, 77, 82, 87, 90, 96, 99, 103, 109, 114, 117, 121, 128, 130, 136, 141, 144, 149, 154, 159, 162, 168, 171, 175, 181, 186, 189, 194, 199, 203, 209, 213, 216, 222, 225, 230, 235, 239, 245, 249

Offset: 1

Clark Kimberling, Feb 10 2023

This is the second 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'.
Every positive integer is in exactly one of the four sequences. Their limiting densities are 4/9, 2/9, 2/9, 1/9 (and likewise for A360394-A360397 and A360402-A360405).

			(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

Cf. A026530, A356133, A360392, A360393, A360398, A286355, A286356, A360394 (intersections instead of results of composition), A360402-A360405.

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

A360400 a(n) = A356133(A360392(n)).

Original entry on oeis.org

7, 13, 20, 22, 29, 32, 34, 40, 47, 49, 53, 58, 62, 67, 74, 76, 83, 85, 89, 94, 97, 104, 110, 112, 115, 122, 127, 131, 137, 140, 142, 148, 155, 157, 161, 166, 169, 176, 182, 184, 187, 193, 200, 202, 208, 211, 215, 220, 223, 229, 236, 238, 244, 247, 251, 257

Offset: 1

Clark Kimberling, Mar 11 2023

This is the third 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'.
Every positive integer is in exactly one of the four sequences. Their limiting densities are 4/9, 2/9, 2/9, 1/9 (and likewise for A360394-A360397 and A360402-A360405).

			(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

Cf. A026530, A356133, A360392, A360393, A360398, A286354, A286356, A360394 (intersections instead of results of composition), A360402-A360405.

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

A360403 a(n) = A360393(A026430(n)).

Original entry on oeis.org

1, 4, 9, 13, 19, 22, 24, 31, 36, 40, 42, 49, 51, 58, 64, 66, 73, 76, 78, 85, 87, 94, 99, 103, 106, 112, 117, 121, 126, 129, 133, 139, 144, 148, 150, 157, 159, 166, 171, 175, 178, 184, 189, 193, 199, 202, 204, 210, 213, 220, 225, 229, 235, 238, 240, 246, 253

Offset: 1

Clark Kimberling, Mar 11 2023

This is the second 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) v o u, defined by (v o u)(n) = v(u(n));
(2) v' o u;
(3) v o u';
(4) v' o u.
Every positive integer is in exactly one of the four sequences. Their limiting densities are 4/9, 2/9, 2/9, 1/9, respectively (and likewise for A360394-A360401).

			(1)  v o u = (3, 7, 10, 11, 14, 16, 17, 20, 23, 25, 26, 29, 30, 33, 37, ...) = A360402
(2)  v' o u = (1, 4, 9, 13, 19, 22, 24, 31, 36, 40, 42, 49, 51, 58, 64, ...) = A360403
(3)  v o u' = (5, 8, 12, 18, 21, 28, 32, 35, 39, 46, 50, 53, 59, 62, 67, ...) = A360404
(4)  v' o u' = (2, 6, 15, 27, 34, 45, 55, 60, 69, 81, 91, 96, 108, 114, ...) = A360405

Winston de Greef, Table of n, a(n) for n = 1..10000

Cf. A026530, A360392, A360393, A360394-A3546352 (intersections instead of results of compositions), A360398-A360401 (results of reversed compositions), A360402, A360404, A360405.

z = 2000; zz = 100;
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 *)
Table[v[[u[[n]]]], {n, 1, zz}]    (* A360402 *)
Table[v1[[u[[n]]]], {n, 1, zz}]   (* A360403 *)
Table[v[[u1[[n]]]], {n, 1, zz}]   (* A360404 *)
Table[v1[[u1[[n]]]], {n, 1, zz}]  (* A360405 *)

def A360393(n):
    if n < 3: return [0, 1, 2][n]
    return 3*n - 5 - (n-3).bit_count() % 2
def A026430(n): return n+(n-1>>1)+(n-1&1|(n.bit_count()&1^1))
def A360403(n): return A360393(A026430(n)) # Winston de Greef, Mar 24 2023

cp's OEIS Frontend

A360136 a(n) = 1 + A026430(A026430(n)).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Python

A359353 a(n) = A026430(A285953(n+1)).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A360134 a(n) = A356133(1 + A026430(n)).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Python

A360137 a(n) = V(A026430(n)), where V(1) = 1 and V(k) = A285953(k+1) for k >= 2.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A360138 a(n) = 1 + A026430(A356133(n)).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Python

A360395 Intersection of A026430 and A360394.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A360396 Intersection of A356133 and A360392.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A360399 a(n) = A026430(1 + A360393(n)).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A360400 a(n) = A356133(A360392(n)).

Views

Author

Keywords