# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a059708
Showing 1-1 of 1

%I A059708 #22 Feb 13 2017 00:25:32
%S A059708 0,1,2,3,4,5,6,7,8,9,11,13,15,17,19,20,22,24,26,28,31,33,35,37,39,40,
%T A059708 42,44,46,48,51,53,55,57,59,60,62,64,66,68,71,73,75,77,79,80,82,84,86,
%U A059708 88,91,93,95,97,99,111,113,115,117,119,131,133,135,137,139
%N A059708 Numbers n such that all digits have same parity.
%C A059708 A059717(a(n)) = a(n). - _Reinhard Zumkeller_, Jul 05 2011
%C A059708 A059707(a(n)) = a(n). - _Reinhard Zumkeller_, Jun 15 2012
%H A059708 Reinhard Zumkeller, <a href="/A059708/b059708.txt">Table of n, a(n) for n = 1..10000</a>
%H A059708 <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>.
%t A059708 Select[Range[0, 140], (cnt = Count[id = IntegerDigits[#], _?OddQ]; cnt == 0 || cnt == Length[id]) & ] (* _Jean-François Alcover_, May 16 2013 *)
%o A059708 (Haskell)
%o A059708 a059708 n = a059708_list !! (n-1)
%o A059708 a059708_list = filter sameParity [0..] where
%o A059708    sameParity n = all (`elem` "02468") ns
%o A059708                || all (`elem` "13579") ns where ns = show n
%o A059708 -- _Reinhard Zumkeller_, Jul 05 2011
%Y A059708 Union of A014261 and A014263.
%Y A059708 Cf. A059707, A061383.
%K A059708 nonn,base,easy,look
%O A059708 1,3
%A A059708 _N. J. A. Sloane_, Feb 07 2001

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE