This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A110795 #18 Nov 24 2024 13:17:50 %S A110795 1,2,6,600,600,25200,25200,483840,698867688960,6988676889600, %T A110795 293599799539200,489718781798400,48196817186918400, %U A110795 4091568555865190400,84446094349064448000,2308054967694508032000,4070651384548315607040000,46671804001710040817664000,46671804001710040817664000 %N A110795 Least multiple of n! that leaves a palindrome if trailing zeros are ignored. %H A110795 Max Alekseyev, <a href="/A110795/b110795.txt">Table of n, a(n) for n = 1..25</a> %e A110795 a(8) = 483840 = 8!*12, ignoring the trailing zero gives 48384 which is a palindrome. %p A110795 A004151 := proc(n) local a ; a := n ; while a mod 10 = 0 do a := a/10 ; end: RETURN(a); end: isA002113 := proc(n) local digs,i ; digs := convert(n,base,10) ; for i from 1 to nops(digs)/2 do if op(i,digs) <> op(-i,digs) then RETURN(false) ; fi ; od; RETURN(true) ; end: A110795 := proc(n) local nf,k ; nf := n! ; k := 1 ; while not isA002113(A004151(k*nf)) do k := k+1 ; od: RETURN(k*nf) ; end: seq(A110795(n),n=1..9) ; # _R. J. Mathar_, Aug 17 2007 %Y A110795 Cf. A110796. %K A110795 base,nonn %O A110795 1,2 %A A110795 _Amarnath Murthy_, Aug 13 2005 %E A110795 Corrected and extended by _R. J. Mathar_, Aug 17 2007 %E A110795 a(11)-a(13) from _Donovan Johnson_, Nov 15 2009 %E A110795 a(14)-a(16) from _Donovan Johnson_, Feb 01 2011 %E A110795 Terms a(17) onward from _Max Alekseyev_, Feb 06 2024