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