A350494 Divide n by the greatest common divisor of the nonzero digits of n.

1, 1, 1, 1, 1, 1, 1, 1, 1, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 10, 21, 11, 23, 12, 25, 13, 27, 14, 29, 10, 31, 32, 11, 34, 35, 12, 37, 38, 13, 10, 41, 21, 43, 11, 45, 23, 47, 12, 49, 10, 51, 52, 53, 54, 11, 56, 57, 58, 59, 10, 61, 31, 21, 32, 65, 11, 67

Offset: 1

Author

Rémy Sigrist, Jan 01 2022

Keywords

• nonn
• base
• look
• easy

Examples

			a(42) = 42 / gcd(4, 2) = 42 / 2 = 21.
		

Links

• Rémy Sigrist, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A052423, A069715.

Programs

PARI

a(n) = n / gcd(digits(n))

Python

from math import gcd
def a(n): return n//gcd(*[int(d) for d in str(n)])
print([a(n) for n in range(1, 68)]) # Michael S. Branicky, Jan 01 2022

Formula

a(n) = n / A052423(n).

a(n) = n iff n belongs to A069715.

a(a(n)) = a(n).