login
This site is supported by donations 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
1, 22, 111, 4004, 50005, 201102, 1103011, 21100112, 100070001, 1000800010, 20009090002, 210003300012, 1000276720001, 20000055000002, 500000050000005, 2110000440000112, 10000007170000001, 200000007700000002 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

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

CROSSREFS

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

Sequence in context: A041938 A084013 A083123 * A089184 A079466 A079676

Adjacent sequences:  A084014 A084015 A084016 * A084018 A084019 A084020

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy and Meenakshi Srikanth (amarnath_murthy(AT)yahoo.com), May 23 2003

EXTENSIONS

Corrected and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Jun 09 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 04:56 EST 2012. Contains 205694 sequences.