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 A078453 #9 Dec 24 2022 04:46:43 %S A078453 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,21,23,25,27,29,31, %T A078453 32,34,35,37,38,41,43,45,47,49,51,52,53,54,56,57,58,59,61,65,67,71,72, %U A078453 73,74,75,76,78,79,81,83,85,87,89,91,92,94,95,97,98 %N A078453 Numbers in which all the digits are coprime to each other. %t A078453 Join[Range[0,9],Select[Range[10,98],GCD@@IntegerDigits[#]==1 &]] (* _Stefano Spezia_, Dec 23 2022 *) %o A078453 (Python) %o A078453 from math import gcd %o A078453 from functools import reduce %o A078453 def ok(n): %o A078453 d = list(map(int, str(n))) %o A078453 return len(d) == 1 or reduce(gcd, d) == 1 %o A078453 print([k for k in range(100) if ok(k)]) # _Michael S. Branicky_, Dec 23 2022 %Y A078453 Cf. A069715. %K A078453 base,easy,nonn %O A078453 1,3 %A A078453 _Amarnath Murthy_, Nov 28 2002