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 A061116 #22 Jul 02 2025 16:02:01
%S A061116 11,13,17,19,21,23,27,29,31,37,41,43,47,49,51,53,57,59,61,67,71,73,79,
%T A061116 81,83,87,89,91,97,111,113,117,119,121,127,131,133,137,139,141,143,
%U A061116 149,151,157,161,163,167,169,171,173,177,179,181,187,191,193,197,199,211
%N A061116 Numbers coprime to each of their decimal digits.
%C A061116 A138707(a(n)) = 1; subsequence of A138708. - _Reinhard Zumkeller_, Mar 26 2008
%H A061116 Michael S. Branicky, <a href="/A061116/b061116.txt">Table of n, a(n) for n = 1..10000</a>
%H A061116 <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>.
%e A061116 27 is a member as 2 and 7 both are coprime to 27. 53 is a member as 5 and 3 both are coprime to 53.
%p A061116 for n from 2 to 500 do it1 := convert(n, base, 10): flag := 1: for k from 1 to nops(it1) do if igcd(n, it1[k])<>1 then flag := 0 fi: od: if flag=1 then printf(`%d,`,n) fi: od:
%t A061116 Select[Range[11, 191, 2], CoprimeQ[Product[i, {i, IntegerDigits[#]}], #] &] (* _Arkadiusz Wesolowski_, May 19 2012 *)
%o A061116 (Python)
%o A061116 from math import gcd
%o A061116 def ok(n): return n > 1 and all(gcd(n, int(d)) == 1 for d in str(n))
%o A061116 print([k for k in range(212) if ok(k)]) # _Michael S. Branicky_, Nov 13 2021
%Y A061116 Cf. A138707, A138708.
%K A061116 nonn,base
%O A061116 1,1
%A A061116 _Amarnath Murthy_, Apr 21 2001
%E A061116 More terms from _James Sellers_, Apr 23 2001