login

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”).

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
1, 22, 111, 4004, 50005, 201102, 1103011, 21100112, 100070001, 1000800010, 20009090002, 210003300012, 1000276720001, 20000055000002, 500000050000005, 2110000440000112, 10000007170000001, 200000007700000002
OFFSET
1,2
COMMENTS
In most cases the digit sum is n for large n. Conjecture: No entry is zero.
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 23 2003
EXTENSIONS
Corrected and extended by Ray Chandler, Jun 09 2003
STATUS
approved