This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A350697 #11 Jan 17 2022 11:21:49
%S A350697 2,2,2,2,4,4,4,3,32,2,2,2,2,2,4,3,4,16,12,2,2,2,2,2,8,8,18,3,14,2,2,2,
%T A350697 2,2,8,8,6,6,12,2,2,2,2,2,64,10,6,5,14,4,4,4,8,9,4,4,4,7,14,4,4,4,14,
%U A350697 7,4,4,4,3,12,4,4,4,28,3,8,3,6,6,34,3,6,3,8,5,8
%N A350697 Smallest number m > 1 such that n * m = A350538(n) contains only even digits.
%C A350697 The smallest odd term is a(48) = 5 because 48*5 = 240.
%C A350697 Record values of a(n) are 2, 4, 32, 64, ...
%F A350697 a(n) = A350538(n) / n.
%e A350697 The smallest proper multiple of 9 with only even digits is A350538(9) = 288, as 288 = 9 * 32, a(9) = 32.
%t A350697 a[n_] := Module[{k = 2*n}, While[! AllTrue[IntegerDigits[k], EvenQ], k += n]; k/n]; Array[a, 100] (* _Amiram Eldar_, Jan 12 2022 *)
%o A350697 (PARI) a(n) = my(k=2); while(#select(x->((x%2) == 1), digits(k*n)), k++); k; \\ _Michel Marcus_, Jan 12 2022
%Y A350697 Cf. A061807, A350536, A350537, A350538.
%K A350697 nonn,base
%O A350697 1,1
%A A350697 _Bernard Schott_, Jan 12 2022
%E A350697 More terms from _Michel Marcus_, Jan 12 2022