OFFSET
0,2
COMMENTS
Every integer n has a multiple of the form 99...9900...00. To see that n has a multiple that's a palindrome (allowing 0's on the left) with even digits, let 9n divide 99...9900...00; then n divides 22...2200...00. - Dean Hickerson, Jun 29 2001
EXAMPLE
a(7) = 686 as 686 = 98*7 is the smallest palindrome multiple of 7 with even digits.
PROG
(ARIBAS): stop := 500000; for n := 0 to 60 do k := 1; test := true; while test and k < stop do m := omit_trailzeros(n*k); if test := not all_even(m) or m <> int_reverse(m) then inc(k); end; end; if k < stop then write(n*k, " "); else write(-1, " "); end; end;
(Haskell)
a062293 0 = 0
a062293 n = head [x | x <- map (* n) [1..],
all (`elem` "02468") $ show x, a136522 (a004151 x) == 1]
-- Reinhard Zumkeller, Feb 01 2012
CROSSREFS
KEYWORD
nonn,base,easy
AUTHOR
Amarnath Murthy, Jun 18 2001
EXTENSIONS
Corrected and extended by Klaus Brockhaus, Jun 21 2001
STATUS
approved