Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #10 Jan 03 2022 15:08:11
%S 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,
%T 27,14,29,10,31,32,11,34,35,12,37,38,13,10,41,21,43,11,45,23,47,12,49,
%U 10,51,52,53,54,11,56,57,58,59,10,61,31,21,32,65,11,67
%N Divide n by the greatest common divisor of the nonzero digits of n.
%H Rémy Sigrist, <a href="/A350494/b350494.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = n / A052423(n).
%F a(n) = n iff n belongs to A069715.
%F a(a(n)) = a(n).
%e a(42) = 42 / gcd(4, 2) = 42 / 2 = 21.
%o (PARI) a(n) = n / gcd(digits(n))
%o (Python)
%o from math import gcd
%o def a(n): return n//gcd(*[int(d) for d in str(n)])
%o print([a(n) for n in range(1, 68)]) # _Michael S. Branicky_, Jan 01 2022
%Y Cf. A052423, A069715.
%K nonn,base,look,easy
%O 1,10
%A _Rémy Sigrist_, Jan 01 2022