proposed

approved

editing

proposed

Conjectured to be equal to the lexicographically earliest infinite sequence such that b(i) = b(j) => A000593(i) = A000593(j) and A336467(i) = A336467(j) for all i, j >= 1. In any case, a(i) = a(j) => b(i) = b(j) for all i, j >= 1 [because both A000593(n) and A336467(n) can be represented as functions computed from the values of A206787(n) and A336651(n)], but whether the implication holds to the opposite direction is still open. Empirically this has been checked up to n = 2^22. See also comment in A351040.

Conjectured to be equal to the lexicographically earliest infinite sequence such that b(i) = b(j) => A000593(i) = A000593(j) and A336467(i) = A336467(j) for all i, j >= 1, i.e., sequence b formed as a restricted growth sequence transform of the ordered pair [A000593(n), A336467(n)]. In any case, a(i) = a(j) => b(i) = b(j) for all i, j >= 1 [because both A000593(n) and A336467(n) can be represented as functions of A206787(n) and A336651(n)], but whether the implication holds in to the opposite direction is still open. Empirically this has been checked up to n = 2^22. See also comment in A351040.

Cf. also A000593, A003602, A291750, A291751, A324400, A336467, A347240, A347385, A351040, A351460.

Conjectured to be equal to the lexicographically earliest infinite sequence such that ab(i) = ab(j) => A000593(i) = A000593(j) and A336467(i) = A336467(j) for all i, j >= 1, i.e., sequence b formed as a restricted growth sequence transform of the ordered pair [A000593(n), A336467(n)]. In any case, a(i) = a(j) => b(i) = b(j) for all i, j >= 1 [because both A000593(n) and A336467(n) can be represented as functions of A206787(n) and A336651(n)], but whether the implication holds in the opposite direction is still open. Empirically this has been checked up to n = 2^22. See also comment in A351040.

Conjectured to be equal to the lexicographically earliest infinite sequence such that a(i) = a(j) => A000593(i) = A000593(j) and A336467(i) = A336467(j) for all i, j >= 1, i.e., sequence b formed as a restricted growth sequence transform of the ordered pair [A000593(n), A336467(n)]. In any case, a(i) = a(j) => b(i) = b(j) for all i, j >= 1 [because both A000593(n) and A336467(n) can be represented as functions of A206787(n) and A336651(n)], but whether the implication holds in the opposite direction is still open. Empirically it this has been checked up to n = 2^22. See also comment in A351040.

Conjectured to be equal to the sequence b formed as a restricted growth sequence transform of the ordered pair [A000593(n), A336467(n)]. In any case, a(i) = a(j) => b(i) = b(j) for all i, j >= 1 [because both A000593(n) and A336467(n) can be represented as functions of A206787(n) and A336651(n)], but whether the implication holds in the opposite direction is still open. Empirically it has been checked up to n = 2^22.

A324400(i) = A324400(j) => A003602(i) = A003602(j) => A351040(i) = A351040(j) => a(i) = a(j),

A351040A324400(i) = A351040A324400(j) => A351460(i) = A351460(j) => a(i) = a(j),

A324400A351040(i) = A324400A351040(j) => A351460(i) = A351460(j) => a(i) = a(j),

Cf. also A000593, A291750, A291751, A324400, A336467, A347240, A347385, A351040, A351460.