Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Mar 19 2024 12:00:09
%S 2,2,6,4,20,6,28,8,288,20,22,24,26,28,60,48,68,288,228,20,42,22,46,24,
%T 200,26,486,28,406,60,62,64,66,68,280,288,222,228,468,40,82,42,86,44,
%U 2880,46,282,48,686,200,204,208,424,486,220,224,228,406,826,60,244,62
%N Smallest positive multiple of n containing only even digits.
%H Paul Tek, <a href="/A061807/b061807.txt">Table of n, a(n) for n = 1..10000</a>
%e a(7) = 28 because among the multiples of 7, that is, 7, 14, 21, 28,... 28 is the smallest multiple with only even digits.
%t Table[k = n; While[Length[Intersection[{1, 3, 5, 7, 9}, IntegerDigits[k]]] > 0, k = k + n]; k, {n, 100}] (* _T. D. Noe_, Jun 03 2013 *)
%t spme[n_]:=Module[{k=1},While[AnyTrue[IntegerDigits[k*n],OddQ],k++];k*n]; Array[spme,70] (* _Harvey P. Dale_, Mar 19 2024 *)
%Y Cf. A067044, A061808.
%K base,nonn,easy
%O 1,1
%A _Amarnath Murthy_, May 28 2001
%E Corrected and extended by Larry Reeves (larryr(AT)acm.org), May 29 2001