OFFSET
1,1
COMMENTS
Numbers like 111 are ignored, at least two different digits are required.
LINKS
G. C. Greubel, Table of n, a(n) for n = 1..5000
EXAMPLE
166 is a composite number whose sum of smallest digit and the largest digit is a prime.
MATHEMATICA
comprQ[n_]:=Module[{idn=IntegerDigits[n]}, CompositeQ[n]&&Length[Union[ idn]]>1&&PrimeQ[Min[idn]+Max[idn]]]; Select[Range[250], comprQ] (* Harvey P. Dale, Mar 29 2015 *)
PROG
(Python)
from sympy import isprime
def ok(n):
digits = list(map(int, str(n)))
repdigit, smlg = len(set(digits)) == 1, min(digits) + max(digits)
return not repdigit and isprime(smlg) and not isprime(n)
print([k for k in range(211) if ok(k)]) # Michael S. Branicky, Dec 14 2021
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Parthasarathy Nambi, Aug 01 2009
EXTENSIONS
Corrected and extended by Harvey P. Dale, Mar 29 2015
STATUS
approved