A283868 For all n, the set including the terms {a(1), a(2), a(3), ..., a(n)} has a nonprime number of digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9.

1, 2, 3, 4, 5, 6, 7, 8, 9, 111, 11, 101, 222, 22, 122, 12, 112, 333, 33, 444, 44, 555, 55, 666, 66, 777, 77, 888, 88, 999, 99, 1111, 1122, 1133, 13, 31, 1144, 14, 41, 133, 144, 1155, 115, 15, 155, 166, 16, 116, 177, 17, 117, 1166, 188, 18, 118, 199, 19, 91, 212, 121, 21, 221, 313, 223, 23, 233, 331, 113, 131, 414, 114, 224

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

Jean-Marc Falcoz, Table of n, a(n) for n = 1..3000

Example

The set consisting of the first 15 terms is {1,2,3,4,5,6,7,8,9,111,11,101,222,22,122}; we count one 0, nine 1's, eight 2's, one 3, one 4, one 5, etc. All those quantities of digits are nonprime numbers.

Crossrefs

Sequence in context: A181352 A056143 A106003 * A087995 A082232 A117228

Adjacent sequences: A283865 A283866 A283867 * A283869 A283870 A283871

Keyword

nonn,base

Author

Eric Angelini and Jean-Marc Falcoz, Mar 17 2017

Status

approved