

A083960


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.


1



1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 11, 2112, 131131, 414414, 5115, 61616, 7111117, 8118, 99199, 2, 1121211, 22, 32223, 4224, 525, 262262, 22222722222, 828828, 922229, 3, 133331, 23232, 33, 4333334, 535535, 6336, 333777333, 88388, 393393, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

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


LINKS



CROSSREFS



KEYWORD

base,nonn


AUTHOR

Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 20 2003


EXTENSIONS



STATUS

approved



