|
%I #17 Jan 26 2024 04:24:58
%S 66,286,606,682,2222,2486,2626,2882,3333,3939,5555,6262,6842,6886,
%T 7777,9393,14443,18887,22462,22682,22826,24266,26422,26462,26686,
%U 28622,33693,34441,36399,39633,39693,62822,66242,68662,78881,99363,118877,125543,145541
%N Sphenic numbers k = p*q*r such that reversal(k) is also a sphenic number and reversal(k) = reversal(p)*reversal(q)*reversal(r).
%C Subsequence of A007304. A sphenic number is a number that is the product of 3 distinct primes.
%H Chai Wah Wu, <a href="/A242726/b242726.txt">Table of n, a(n) for n = 1..2175</a>
%e 3196751 = 31*101*1021 is in the sequence because reversal(3196751) = 1576913 = 13*101*1201 => 31 = reversal(13), 101 = reversal(101) and 1201 = reversal(1021).
%p with(numtheory):
%p for n from 30 to 150000 do :
%p x:=factorset(n):n1:=nops(x):
%p if bigomega(n)= 3 and n1>2
%p then
%p y:=convert(n,base,10):n2:=nops(y):
%p p:=x[1]:q:=x[2]:r:=x[3]:
%p xp1:=convert(p,base,10):nxp1:=nops(xp1):
%p xq1:=convert(q,base,10):nxq1:=nops(xq1):
%p xr1:=convert(r,base,10):nxr1:=nops(xr1):
%p sp:=sum('xp1[i]*10^(nxp1-i)', 'i'=1..nxp1):
%p sq:=sum('xq1[i]*10^(nxq1-i)', 'i'=1..nxq1):
%p sr:=sum('xr1[i]*10^(nxr1-i)', 'i'=1..nxr1):
%p lst:={sp} union {sq} union {sr}:
%p s:=sum('y[i]*10^(n2-i)', 'i'=1..n2):x1:=factorset(s):nn1:=nops(x1):
%p if bigomega(s)=3 and nn1>2
%p then
%p z:=convert(s,base,10):n3:=nops(z):
%p p1:=x1[1]:q1:=x1[2]:r1:=x1[3]:
%p lst1:={p1} union {q1} union {r1}:
%p s1:=sum('z[i]*10^(n3-i)','i'=1..n3):
%p if lst = lst1
%p then
%p printf(`%d, `,n):
%p else
%p fi:
%p fi:
%p fi:
%p od:
%Y Cf. A007304, A242592.
%K nonn,base
%O 1,1
%A _Michel Lagneau_, May 21 2014
|
