OFFSET
1,1
COMMENTS
Heuristically, there are 15/(8 log 10) * n^(log_10 4) members up to n, or about 0.814 * n^0.602.
LINKS
Harvey P. Dale, Table of n, a(n) for n = 1..1000
EXAMPLE
13 is prime and it has one nonprime digit, 1;
3259 is prime and it has one nonprime digit, 9.
MAPLE
stev_sez:=proc(n) local i, tren, st, ans, anstren; ans:=[ ]: anstren:=[ ]: tren:=n: for i while (tren>0) do st:=round( 10*frac(tren/10) ): ans:=[ op(ans), st ]: tren:=trunc(tren/10): end do; for i from nops(ans) to 1 by -1 do anstren:=[ op(anstren), op(i, ans) ]; od; RETURN(anstren); end:
ts_stnepf:=proc(n) local i, stpf, ans; ans:=stev_sez(n): stpf:=0: for i from 1 to nops(ans) do if (isprime(op(i, ans))='false') then stpf:=stpf+1; # number of nonprime digits fi od; RETURN(stpf) end:
ts_pr_neprn:=proc(n) local i, stpf, ans, ans1, tren; ans:=[ ]: stpf:=0: tren:=1: for i from 1 to n do if ( isprime(i)='true' and ts_stnepf(i) = 1) then ans:=[ op(ans), i ]: tren:=tren+1; fi od; RETURN(ans) end: ts_pr_neprn(4000);
MATHEMATICA
Select[Prime[Range[200]], Count[IntegerDigits[#], _?(!PrimeQ[#]&)]==1&] (* Harvey P. Dale, Feb 18 2018 *)
CROSSREFS
KEYWORD
nonn,base,easy
AUTHOR
Jani Melik, Apr 11 2004
EXTENSIONS
Edited by R. J. Mathar, Nov 02 2009
Comment from Charles R Greathouse IV, Mar 19 2010
STATUS
approved