The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A084013 Smallest n-digit palindromic multiple of n. For n = 10k it is sufficient that the multiple is palindromic with leading zeros ignored. 0 if no such number exists. 4

%I #6 Aug 23 2014 13:11:15

%S 1,22,111,2112,50005,201102,1002001,21100112,100070001,1000000010,

%T 10000200001,400002200004,1000029200001,20000055000002,

%U 500000020000005,2110000000000112,10000000200000001,200000007700000002

%N Smallest n-digit palindromic multiple of n. For n = 10k it is sufficient that the multiple is palindromic with leading zeros ignored. 0 if no such number exists.

%C Conjecture: no entry is zero.

%Y Cf. A084014, A084015, A084016.

%K base,nonn

%O 1,2

%A _Amarnath Murthy_ and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 23 2003

%E Corrected and extended by _Ray Chandler_, Jun 08 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 7 22:54 EST 2023. Contains 367662 sequences. (Running on oeis4.)