[go: up one dir, main page]

login
Revision History for A092622 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Primes with exactly two prime digits.
(history; published version)
#4 by Russ Cox at Sat Mar 31 14:40:00 EDT 2012
AUTHOR

_Jani Melik (jani_melik(AT)hotmail.com), _, Apr 11 2004

Discussion
Sat Mar 31
14:40
OEIS Server: https://oeis.org/edit/global/936
#3 by Charles R Greathouse IV at Sun Nov 14 19:52:39 EST 2010
STATUS

proposed

approved

#2 by Charles R Greathouse IV at Sun Nov 14 19:52:34 EST 2010
NAME

Primes with exactly two prime digits.

FORMULA

a(n) >> n^1.285

KEYWORD

nonn,base,new

STATUS

approved

proposed

#1 by N. J. A. Sloane at Sat Jun 12 03:00:00 EDT 2004
NAME

Primes with two prime digits.

DATA

23, 37, 53, 73, 127, 137, 157, 173, 229, 239, 251, 263, 271, 283, 293, 307, 313, 317, 331, 347, 359, 367, 379, 383, 397, 433, 457, 503, 521, 547, 563, 571, 587, 593, 653, 673, 677, 739, 743, 751, 787, 797, 823, 827, 853, 857, 877, 937, 953, 977, 1033, 1123

OFFSET

1,1

EXAMPLE

23 is prime and it has two prime digits, 2 and 3;

127 is prime and it has two prime digits 2 and 7.

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_stpf:=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))='true') then stpf:=stpf+1; # number of prime digits fi od; RETURN(stpf) end: ts_pr_prnd:=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_stpf(i) = 2) then ans:=[ op(ans), i ]: tren:=tren+1; fi od; RETURN(ans) end: ts_pr_prnd(2500);

CROSSREFS

Cf. A034844.

KEYWORD

nonn

AUTHOR

Jani Melik (jani_melik(AT)hotmail.com), Apr 11 2004

STATUS

approved