A230105 Numbers n such that m + (product of digits of m) = n has exactly one solution m.

0, 2, 4, 6, 8, 22, 23, 24, 28, 29, 30, 32, 34, 35, 40, 41, 42, 44, 45, 46, 47, 54, 55, 56, 58, 65, 66, 67, 68, 75, 78, 81, 85, 88, 89, 90, 92, 94, 95, 101, 103, 105, 106, 108, 112, 114, 122, 124, 125, 128, 129, 132, 135, 141, 143, 144, 145, 146, 147, 152, 154, 155, 156, 158, 161, 165, 166, 167, 168, 175, 178, 181, 185

Offset

1,2

Comments

Numbers n such that A230103(n) = 1.

Links

Michael S. Branicky, Table of n, a(n) for n = 1..10000

Index entries for Colombian or self numbers and related sequences

Prog

(Python)
from math import prod
from collections import Counter
def b(n): return n + prod(map(int, str(n)))
def aupto(n):
    c = Counter(b(m) for m in range(n+1))
    return [k for k in range(n+1) if c[k] == 1]
print(aupto(185)) # Michael S. Branicky, Jan 09 2023

Crossrefs

Cf. A230099, A230103, A230104.

Sequence in context: A079206 A265342 A335661 * A045926 A045927 A165931

Adjacent sequences: A230102 A230103 A230104 * A230106 A230107 A230108

Keyword

nonn,base

Author

N. J. A. Sloane, Oct 13 2013

Status

approved