LINKS
P. De Geest, <a href="httphttps://www.worldofnumbers.com/em36.htm">Smallest multipliers to make a number palindromic</a>.
The OEIS is supported by the many generous donors to the OEIS Foundation.
P. De Geest, <a href="httphttps://www.worldofnumbers.com/em36.htm">Smallest multipliers to make a number palindromic</a>.
proposed
approved
editing
proposed
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.
approved
editing
editing
approved
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.
approved
editing
_Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), _, Jun 25 2001
Every positive integer is a factor of a palindrome, unless it is a multiple of 10 (D. G. Radcliffe, see Linkslinks).
base,easy,nonn,new
(ARIBAS): stop := 200000; for n := 0 to maxarg do k := 1; test := true; while test and k < stop do mp := omit_trailzeros(n)*k; if test := mp <> int_reverse(mp) then inc(k); end; end; if k < stop then write(mp, " "); else write(-1, " "); end; end;
base,easy,nonn,new
Obtain m by omitting trailing zeros from n (cf. A004151); a(n) = smallest multiple k*m which is a palindrome.
base,easy,nonn,new