This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A350494 #10 Jan 03 2022 15:08:11 %S A350494 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 A350494 27,14,29,10,31,32,11,34,35,12,37,38,13,10,41,21,43,11,45,23,47,12,49, %U A350494 10,51,52,53,54,11,56,57,58,59,10,61,31,21,32,65,11,67 %N A350494 Divide n by the greatest common divisor of the nonzero digits of n. %H A350494 Rémy Sigrist, <a href="/A350494/b350494.txt">Table of n, a(n) for n = 1..10000</a> %F A350494 a(n) = n / A052423(n). %F A350494 a(n) = n iff n belongs to A069715. %F A350494 a(a(n)) = a(n). %e A350494 a(42) = 42 / gcd(4, 2) = 42 / 2 = 21. %o A350494 (PARI) a(n) = n / gcd(digits(n)) %o A350494 (Python) %o A350494 from math import gcd %o A350494 def a(n): return n//gcd(*[int(d) for d in str(n)]) %o A350494 print([a(n) for n in range(1, 68)]) # _Michael S. Branicky_, Jan 01 2022 %Y A350494 Cf. A052423, A069715. %K A350494 nonn,base,look,easy %O A350494 1,10 %A A350494 _Rémy Sigrist_, Jan 01 2022