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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A084017 Smallest n-digit palindromic multiple of n with a digit sum that is also a multiple of n. For n = 10k it is sufficient that the multiple is palindromic with leading zeros ignored. 0 if no such number exists. 1

%I #6 Aug 25 2014 12:17:04

%S 1,22,111,4004,50005,201102,1103011,21100112,100070001,1000800010,

%T 20009090002,210003300012,1000276720001,20000055000002,

%U 500000050000005,2110000440000112,10000007170000001,200000007700000002

%N Smallest n-digit palindromic multiple of n with a digit sum that is also a 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 In most cases the digit sum is n for large n. Conjecture: No entry is zero.

%Y Cf. A084013, A084014, A084015, A084016, A084018.

%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 09 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 20 18:22 EDT 2024. Contains 375338 sequences. (Running on oeis4.)