login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A061116 Numbers coprime to each of their decimal digits. 4

%I #21 Nov 13 2021 11:23:38

%S 11,13,17,19,21,23,27,29,31,37,41,43,47,49,51,53,57,59,61,67,71,73,79,

%T 81,83,87,89,91,97,111,113,117,119,121,127,131,133,137,139,141,143,

%U 149,151,157,161,163,167,169,171,173,177,179,181,187,191,193,197,199,211

%N Numbers coprime to each of their decimal digits.

%C A138707(a(n)) = 1; subsequence of A138708. - _Reinhard Zumkeller_, Mar 26 2008

%H Michael S. Branicky, <a href="/A061116/b061116.txt">Table of n, a(n) for n = 1..10000</a>

%H <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>.

%e 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 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 Select[Range[11, 191, 2], CoprimeQ[Product[i, {i, IntegerDigits[#]}], #] &] (* _Arkadiusz Wesolowski_, May 19 2012 *)

%o (Python)

%o from math import gcd

%o def ok(n): return n > 1 and all(gcd(n, int(d)) == 1 for d in str(n))

%o print([k for k in range(212) if ok(k)]) # _Michael S. Branicky_, Nov 13 2021

%Y Cf. A138707, A138708.

%K nonn,base

%O 1,1

%A _Amarnath Murthy_, Apr 21 2001

%E More terms from _James A. Sellers_, Apr 23 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 12 16:19 EDT 2024. Contains 372492 sequences. (Running on oeis4.)