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 A066750 #24 Jan 26 2022 17:57:40
%S A066750 1,2,3,4,5,6,7,8,9,1,1,3,1,1,3,1,1,9,1,2,3,2,1,6,1,2,9,2,1,3,1,1,3,1,
%T A066750 1,9,1,1,3,4,1,6,1,4,9,2,1,12,1,5,3,1,1,9,5,1,3,1,1,6,1,2,9,2,1,6,1,2,
%U A066750 3,7,1,9,1,1,3,1,7,3,1,8,9,2,1,12,1,2,3,8,1,9
%N A066750 Greatest common divisor of n and its digit sum.
%C A066750 a(n) = 1 iff n is in A339076. - _Bernard Schott_, Jan 17 2022
%H A066750 Harry J. Smith, <a href="/A066750/b066750.txt">Table of n, a(n) for n = 1..1000</a>
%t A066750 Table[GCD[n,Total[IntegerDigits[n]]],{n,100}] (* _Harvey P. Dale_, Aug 13 2015 *)
%o A066750 (PARI) a(n) = gcd(n, sumdigits(n)); \\ _Michel Marcus_, Jan 17 2022
%o A066750 (Python)
%o A066750 from math import gcd
%o A066750 def A066750(n): return gcd(n,sum(int(d) for d in str(n))) # _Chai Wah Wu_, Jan 26 2022
%Y A066750 Cf. A007953, A339076.
%K A066750 nonn,base
%O A066750 1,2
%A A066750 _Reinhard Zumkeller_, Jan 16 2002