OFFSET
1,3
COMMENTS
The sequence is started with a(1) = 0 and always extended with the smallest integer not yet present and not leading to a contradiction.
If two successive digits are equal (e.g., 3,3) we accept that there is a "larger one" (3).
LINKS
Jean-Marc Falcoz, Table of n, a(n) for n = 1..10001
EXAMPLE
In the 1st pair of integers (0,1) the larger term is (1), which is odd;
in the 2nd pair of integers (1,3) the larger term is (3), which is odd;
in the 3rd pair of integers (3,2) the larger term is (3), which is odd;
in the 4th pair of integers (2,5) the larger term is (5), which is odd;
...
in the 9th pair of integers (9,8) the larger term is (9), which is odd;
in the 10th pair of integers (8,91) the larger term is (91), which is odd;
in the 11th pair of integers (91,10) the larger term is (91), which is odd; etc.
In the 1st pair of digits (0,1) the larger digit is (1), which is odd;
in the 2nd pair of digits (1,3) the larger digit is (3), which is odd;
in the 3rd pair of digits (3,2) the larger digit is (3), which is odd;
in the 4th pair of digits (2,5) the larger digit is (5), which is odd;
...
in the 9th pair of digits (9,8) the larger digit is (9), which is odd;
in the 10th pair of digits (8,9) the larger digit is (9), which is odd;
in the 11th pair of digits (9,1) the larger digit is (9), which is odd; etc.
CROSSREFS
Cf. A282665 (even rather than odd).
KEYWORD
nonn,base
AUTHOR
Eric Angelini and Jean-Marc Falcoz, Feb 20 2017
STATUS
approved