login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A038365 Numbers n with property that digits of n are not present in 2n. 4

%I

%S 1,2,3,4,5,6,7,8,9,11,13,14,15,16,17,18,19,22,23,27,28,29,31,32,33,34,

%T 35,36,38,39,41,43,44,45,46,48,52,53,54,55,56,57,58,59,64,65,66,67,69,

%U 72,73,76,77,78,79,82,83,85,86,88,92,93,94,111,113,114,115,116,117,118

%N Numbers n with property that digits of n are not present in 2n.

%C 207 is the smallest number containing a zero, cf. A192825. [_Reinhard Zumkeller_, Aug 09 2011]

%H T. D. Noe, <a href="/A038365/b038365.txt">Table of n, a(n) for n=1..2000</a>

%e 36 is in the list since 2*36=72, which shares no digit with 36.

%t Select[Range[140],Intersection[IntegerDigits[2 #], IntegerDigits[#]] =={}&] (* _Harvey P. Dale_, Apr 30 2011 *)

%o (Haskell)

%o import Data.List (intersect)

%o a038365 n = a038365_list !! (n-1)

%o a038365_list = filter (\x -> null (show (2*x) `intersect` show x)) [1..]

%o -- _Reinhard Zumkeller_, Aug 09 2011

%Y Cf. A129845 (complement).

%K nonn,easy,base,nice

%O 1,2

%A _Erich Friedman_

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 16 03:14 EST 2019. Contains 330013 sequences. (Running on oeis4.)