cp's OEIS Frontend

A029741 Even numbers with distinct digits.

%I A029741 #17 Aug 04 2022 15:52:59
%S A029741 0,2,4,6,8,10,12,14,16,18,20,24,26,28,30,32,34,36,38,40,42,46,48,50,
%T A029741 52,54,56,58,60,62,64,68,70,72,74,76,78,80,82,84,86,90,92,94,96,98,
%U A029741 102,104,106,108,120,124,126,128,130,132,134,136,138,140,142,146
%N A029741 Even numbers with distinct digits.
%C A029741 Largest term is 9876543210. - _Alonso del Arte_, Jan 09 2020
%C A029741 There are 4493646 terms. - _Michael S. Branicky_, Aug 04 2022
%H A029741 Michael S. Branicky, <a href="/A029741/b029741.txt">Table of n, a(n) for n = 1..10000</a>
%H A029741 Patrick De Geest, <a href="http://www.worldofnumbers.com/index.html">World!Of Numbers</a>
%t A029741 Select[2Range[0, 79], Max[DigitCount[#]] == 1 &] (* _Harvey P. Dale_, Dec 23 2013 *)
%o A029741 (Scala) def hasDistinctDigits(n: Int): Boolean = {
%o A029741   val numerStr = n.toString
%o A029741   val digitSet = numerStr.split("").toSet
%o A029741   numerStr.length == digitSet.size
%o A029741 }
%o A029741 (0 to 198 by 2).filter(hasDistinctDigits) // _Alonso del Arte_, Jan 09 2020
%o A029741 (Python) # generates full sequence
%o A029741 from itertools import permutations
%o A029741 afull = [0] + sorted(set(int("".join(p)) for d in range(1, 11) for p in permutations("0123456789", d) if p[0] != "0" and p[-1] in "02468"))
%o A029741 print(afull[:100]) # _Michael S. Branicky_, Aug 04 2022
%Y A029741 Cf. A029740 (odd version). Union of that sequence with this sequence gives A010784.
%K A029741 nonn,fini,base
%O A029741 1,2
%A A029741 _Patrick De Geest_
%E A029741 Offset changed to 1 by _Michael S. Branicky_, Aug 04 2022