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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A115683 Numbers that are the product of 2 palindromes greater than 1. 17

%I #13 Mar 16 2020 09:59:01

%S 4,6,8,9,10,12,14,15,16,18,20,21,22,24,25,27,28,30,32,33,35,36,40,42,

%T 44,45,48,49,54,55,56,63,64,66,72,77,81,88,99,110,121,132,154,165,176,

%U 198,202,220,222,231,242,262,264,275,282,297,302,303,308,322,330,333

%N Numbers that are the product of 2 palindromes greater than 1.

%H Robert Israel, <a href="/A115683/b115683.txt">Table of n, a(n) for n = 1..10000</a>

%e 262 = 2 * 131.

%e 264 = 6 * 11.

%e 275 = 5 * 55.

%p revdigs:= proc(n) local L,i;

%p L:= convert(n,base,10);

%p add(L[-i]*10^(i-1),i=1..nops(L))

%p end proc:

%p N:=4; # to get terms <= 2*10^N

%p Pals:= $2..9:

%p for d from 2 to N do

%p if d::even then

%p m:= d/2;

%p Pals:= Pals, seq(n*10^m + revdigs(n), n=10^(m-1)..10^m-1);

%p else

%p m:= (d-1)/2;

%p Pals:= Pals, seq(seq(n*10^(m+1)+y*10^m+revdigs(n), y=0..9), n=10^(m-1)..10^m-1);

%p fi

%p od:

%p Pals:= {Pals}: nP:= nops(Pals):

%p P2:= select(`<`,{seq(seq(Pals[i]*Pals[j],j=1..i),i=1..nP)},2*10^N):

%p sort(convert(P2,list)); # _Robert Israel_, Mar 16 2020

%t pal = Select[ Range[2, 400], # == FromDigits@ Reverse@ IntegerDigits@ # &]; Select[Union[Times @@@ Tuples[pal, 2]], # <= 400 &] (* _Giovanni Resta_, Jun 20 2016 *)

%Y Cf. A002113, A141322.

%K nonn,base

%O 1,1

%A _Giovanni Resta_, Jan 31 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 02:22 EDT 2024. Contains 371767 sequences. (Running on oeis4.)