OFFSET
1,2
COMMENTS
The sequence is started with a(1) = 1 and always extended with the smallest integer not yet present and not leading to a contradiction.
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
FORMULA
a(n) = A283871(n-10) for n >= 20. - Robert Israel, Jan 07 2024
EXAMPLE
The set consisting of the first 20 terms is {1,2,3,4,5,6,7,8,9,11,22,33,44,55,66,77,88,99,101,1001}; we count three 0's, seven 1's, three 2's, three 3's, three 4's, etc. All those quantities of digits are odd numbers.
MAPLE
filter:= proc(n) local L; L:= convert(n, base, 10);
andmap(t -> numboccur(t, L)::even, L) end proc:
1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 22, 33, 44, 55, 66, 77, 88, 99, 101, op(select(filter, [$1000..9999])); # Robert Israel, Jan 07 2024
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Eric Angelini and Jean-Marc Falcoz, Mar 17 2017
EXTENSIONS
Definition corrected by Robert Israel, Jan 07 2024
STATUS
approved