cp's OEIS Frontend

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.

A083115 Palindromes in A083114.

This page as a plain text file.
%I A083115 #17 Jan 30 2021 10:49:06
%S A083115 1,2,3,4,5,6,7,8,9,11,22,33,111,121,131,141,151,161,171,191,212,222,
%T A083115 313,1111,1221,1331,2112,3113,11111,11211,11311,11411,11511,11711,
%U A083115 12121,12221,13131,21112,21212,31113,111111,112211,121121
%N A083115 Palindromes in A083114.
%C A083115 Intersection of A117056 and A052382. - _Jayanta Basu_, May 15 2013
%H A083115 Charles R Greathouse IV and Chai Wah Wu, <a href="/A083115/b083115.txt">Table of n, a(n) for n = 1..2002</a> (n = 1..59 from Charles R Greathouse IV)
%F A083115 a(n) >> 3^n. - _Charles R Greathouse IV_, May 15 2013
%t A083115 id[n_]:=IntegerDigits[n]; palQ[n_]:=Reverse[x=id[n]]==x; t={}; Do[If[palQ[n] && (y=Times@@id[n])>0 && palQ[Plus@@id[n]] && palQ[y],AppendTo[t,n]],{n,125000}]; t (* _Jayanta Basu_, May 15 2013 *)
%t A083115 spQ[n_]:=Module[{idn=IntegerDigits[n]},FreeQ[idn,0]&&AllTrue[ {n,Total[ idn],Times@@idn},PalindromeQ]]; Select[Range[125000],spQ] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, Jan 30 2021 *)
%o A083115 (PARI) ispal(n)=n=digits(n);for(i=1,#n\2,if(n[i]!=n[#n+1-i],return(0)));1
%o A083115 is(n)=my(d=vecsort(digits(n)));d[1]&&ispal(sum(i=1,#d,d[i]))&&ispal(prod(i=1,#d,d[i]))&&ispal(n) \\ _Charles R Greathouse IV_, May 15 2013
%Y A083115 Cf. A083114.
%K A083115 base,nonn
%O A083115 1,2
%A A083115 _Amarnath Murthy_, Apr 23 2003