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 #4 Aug 11 2024 14:41:34
%S 0,2,2,6,4,-1,6,686,8,666,2,22,444,2002,686,-1,464,646,666,646,2,6006,
%T 22,828,888,-1,2002,8886888,868,464,6,868,4224,66,646,-1,828,222,646,
%U 6006,4,22222,6006,68886,44,-1,828,282,4224,686,-1,42024,4004,424,8886888,-1,8008,68286,464,68086,6
%N Obtain m by omitting trailing zeros from n; a(n) = smallest multiple k*m which is a palindrome with even digits, or -1 if no such multiple exists.
%C a(n) = -1 if and only if m ends with the digit 5.
%H P. De Geest, <a href="https://www.worldofnumbers.com/em36.htm">Smallest multipliers to make a number palindromic</a>.
%e For n = 30 we have m = 3; 3*2 = 6 is a palindrome with even digits, so a(30) = 6.
%o (ARIBAS): stop := 500000; for n := 0 to 60 do k := 1; test := true; while test and k < stop do mp := omit_trailzeros(n)*k; if test := not all_even(mp) or mp <> int_reverse(mp) then inc(k); end; end; if k < stop then write(mp," "); else write(-1," "); end; end;
%Y Cf. A050782, A062293, A061816, A061906. Values of k are given in A061916.
%K base,sign,easy
%O 0,2
%A _Klaus Brockhaus_, Jun 25 2001