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

a(1) = 1; a(n) = smallest palindrome which is a nontrivial multiple of n palindromes (repetitions allowed).
2

%I #5 Dec 05 2013 19:55:20

%S 1,4,8,88,252,2112,2112,2112,4224,8448,48384,48384,405504,405504,

%T 405504,40955904,677707776,677707776,677707776,677707776

%N a(1) = 1; a(n) = smallest palindrome which is a nontrivial multiple of n palindromes (repetitions allowed).

%e a(4) = 88 = 2*2*2*11. 252=2*2*3*3*7 => a(5)=252.

%Y Cf. A071276.

%K base,nonn

%O 1,2

%A _Amarnath Murthy_, Jun 07 2002

%E Corrected and extended by _Sascha Kurz_, Jan 02 2003