OFFSET
1,1
LINKS
Chai Wah Wu, Table of n, a(n) for n = 1..10000
MATHEMATICA
d[n_] := IntegerDigits[n]; t={}; Do[If[!PrimeQ[n] && PrimeQ[Plus@@(x=d[n])] && PrimeQ[Times@@x], AppendTo[t, n]], {n, 2*10^6}]; t
Select[Range[72*10^5], CompositeQ[#]&&AllTrue[{Total[IntegerDigits[#]], Times@@ IntegerDigits[ #]}, PrimeQ]&] (* The program generates the first 25 terms of the sequence. *) (* Harvey P. Dale, May 24 2024 *)
PROG
(Python)
from __future__ import division
from sympy import isprime
A225864_list = []
for l in range(1, 20):
plist, q = [p for p in [2, 3, 5, 7] if isprime(l-1+p)], (10**l-1)//9
for i in range(l):
for p in plist:
r = q+(p-1)*10**i
if not isprime(r):
A225864_list.append(r) # Chai Wah Wu, Aug 15 2017
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Jayanta Basu, May 18 2013
EXTENSIONS
Extended by T. D. Noe, May 18 2013
STATUS
approved