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, 22, 111, 4004, 50005, 201102, 1036301, 21100112, 100070001, 1000800010, 10109090101, 210003300012, 1000276720001, 20000055000002, 500000050000005, 2110000440000112, 10000007170000001, 200000007700000002, 1000000081800000001, 20000000484000000020

Offset

1,2

Comments

In most cases the digit sum is n for large n. Conjecture: No entry is zero.

Links

Table of n, a(n) for n=1..20.

Crossrefs

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

Sequence in context: A041938 A083123 A084013 * A089184 A214216 A079466

Adjacent sequences: A084014 A084015 A084016 * A084018 A084019 A084020

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

a(7) and a(11) corrected and a(19)-a(20) from Sean A. Irvine, Mar 03 2026

Status

approved