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

Smallest palindromic multiple of n in which n is a substring (anywhere), or 0 if n = 10k or no such number exists.

0

`%I #7 Aug 23 2014 14:56:46
`

`%S 1,2,3,4,5,6,7,8,9,0,11,2112,31213,41314,5115,61216,71417,8118,41914,
`

`%T 0,12621,22,32223,4224,525,26962,27972,82628,52925,0,31713,23232,33,
`

`%U 2243422,53235,6336,43734,83638,93639,0,412214,42924,34443,44,5445
`

`%N Smallest palindromic multiple of n in which n is a substring (anywhere), or 0 if n = 10k or no such number exists.
`

`%C Conjecture: a(n) = 0 iff n = 10k. Though many terms match, not the same as A077741.
`

`%Y Cf. A084043, A077741.
`

`%K base,nonn
`

`%O 1,2
`

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

`%E Corrected and extended by _Ray Chandler_, Jun 11 2003
`