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 Feb 14 2015 12:35:21
%S 1,2,3,4,5,6,7,8,9,1,11,2112,131131,414414,5115,61616,7111117,8118,
%T 99199,2,1121211,22,32223,4224,525,262262,22222722222,828828,922229,3,
%U 133331,23232,33,4333334,535535,6336,333777333,88388,393393,4
%N Smallest palindromic multiple of (n with trailing 0's omitted, A004151) using only nonzero digits of n; all digits must appear; or 0 if no such number exists.
%C If one generates all palindromes using all the digits of n with k digits where k starts with the number of digits of n and increases k until one finds a multiple of n, one finds such palindromic multiples much faster than looking for palindromes among the multiples of n. - _W. Edwin Clark_
%Y Cf. A061816, A083961, A004151.
%K base,nonn
%O 1,2
%A _Amarnath Murthy_ and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 20 2003
%E More terms from _W. Edwin Clark_, May 24 2003
%E Corrected by _David Wasserman_, Dec 06 2004