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 A365762 #54 Sep 22 2023 09:08:29
%S A365762 1,2,3,4,5,6,7,8,9,10,1,2,1,2,5,2,1,2,1,20,1,2,1,8,5,2,1,4,1,30,1,2,3,
%T A365762 2,5,18,1,2,3,40,1,2,1,4,5,2,1,16,1,50,1,2,1,2,5,2,1,2,1,60,1,2,9,8,5,
%U A365762 6,1,4,3,70,1,2,1,2,5,2,7,2,1,80,1,2,1,4,5,2,1,8,1,90,1,2,3,2,5,6,1,2,9,100
%N A365762 Greatest common divisor of n and the product of its digits.
%C A365762 This sequence will contain all numbers whose prime factors are exclusively <10 (7-smooth numbers, A002473).
%e A365762 a(11)=1 as 1*1=1; 11 and 1 share 1 as a gcd.
%e A365762 a(15)=5 as 1*5=5; 15 and 5 share 5 as a gcd.
%e A365762 a(10)=10 as 1*0=0; 10 and 0 share 10 as a gcd.
%t A365762 a[n_]:=GCD[n,Product[Part[IntegerDigits[n],i],{i,IntegerLength[n]}]]; Array[a,100] (* _Stefano Spezia_, Sep 20 2023 *)
%o A365762 (Python)
%o A365762 from math import gcd, prod
%o A365762 def a(n): return gcd(n, prod(map(int, str(n))))
%o A365762 print([a(n) for n in range(1, 101)])
%o A365762 (PARI) a(n) = gcd(n, vecprod(digits(n))); \\ _Michel Marcus_, Sep 20 2023
%Y A365762 Cf. A066750, A007954, A002473, A214587.
%K A365762 nonn,base,easy
%O A365762 1,2
%A A365762 _Simon R Blow_, Sep 18 2023