A178341 Smallest multiple of 3 such that decimals digits 1, ..., k (k = 1, ..., 9) and 0 appear in any order.

12, 12, 123, 12234, 12345, 123456, 12234567, 12345678, 123456789, 1023456789

Offset

1,1

Links

Table of n, a(n) for n=1..10.

Example

4 * 3 = 12
4 * 3 = 12
41 * 3 = 123
4078 * 3 = 12234
4115 * 3 = 12345
41152 * 3 = 123456
4078189 * 3 = 12234567
4115226 * 3 = 12345678
41152263 * 3 = 123456789
341152263 * 3 = 1023456789

Prog

(Python)
def a(n):
    digset = "".join(str(d) for d in range(1, min(n+1, 11)))
    target, lb = set(digset), int(digset) if n < 10 else 1023456789
    m = lb if lb%3 == 0 else lb + 3 - lb%3
    while target - set(str(m)): m += 3
    return m
print([a(n) for n in range(1, 11)]) # Michael S. Branicky, Dec 12 2021

Crossrefs

Cf. A178303.

Sequence in context: A219400 A219448 A067123 * A165833 A038338 A221796

Adjacent sequences: A178338 A178339 A178340 * A178342 A178343 A178344

Keyword

base,easy,fini,full,nonn

Author

Eva-Maria Zschorn (e-m.zschorn(AT)zaschendorf.km3.de), May 25 2010

Status

approved