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 A083114 #18 Jul 29 2025 00:22:21
%S A083114 1,2,3,4,5,6,7,8,9,11,12,13,14,15,16,17,18,21,22,23,24,31,32,33,41,42,
%T A083114 51,61,71,81,111,112,113,114,115,116,117,119,121,122,123,124,131,132,
%U A083114 133,141,142,151,161,171,191,211,212,213,214,221,222,231,241
%N A083114 Numbers with nonzero digits whose sum of digits as well as product of digits is a palindrome.
%H A083114 Harvey P. Dale, <a href="/A083114/b083114.txt">Table of n, a(n) for n = 1..912</a> (All terms up to 10^7.)
%t A083114 id[n_]:=IntegerDigits[n]; palQ[n_]:=Reverse[x=id[n]]==x; t={}; Do[If[(y=Times@@id[n])>0 && palQ[Plus@@id[n]] && palQ[y],AppendTo[t,n]],{n,222}]; t (* _Jayanta Basu_, May 15 2013 *)
%t A083114 Select[Range[300],FreeQ[IntegerDigits[#],0]&&AllTrue[{Total[IntegerDigits[#]],Times@@ IntegerDigits[ #]},PalindromeQ]&] (* _Harvey P. Dale_, Mar 25 2024 *)
%o A083114 (PARI) ispal(n)=n=digits(n);for(i=1,#n\2,if(n[i]!=n[#n+1-i],return(0)));1
%o A083114 is(n)=my(d=vecsort(digits(n)));d[1]&&ispal(sum(i=1,#d,d[i]))&&ispal(prod(i=1,#d,d[i])) \\ _Charles R Greathouse IV_, May 15 2013
%Y A083114 Cf. A083115.
%K A083114 base,easy,nonn
%O A083114 1,2
%A A083114 _Amarnath Murthy_, Apr 23 2003
%E A083114 Corrected by _Harvey P. Dale_, Mar 25 2024