The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A089686 a={1,3,7,9} b[n]=Prime[n]*10+a[[4-Mod[n,4]]] c(m) =if b[n] is prime then b[n] 0

%I

%S 79,199,293,311,379,433,613,719,977,1013,1031,1097,1319,1993,2111,

%T 2239,2293,2399,2417,2713,2819,2837,3119,3137,3677,3733,4099,4339,

%U 4397,4799,4877,5039,5231,5419,5477,5573,5717,5939,6311,6473,6599,6733,6917,7013

%N a={1,3,7,9} b[n]=Prime[n]*10+a[[4-Mod[n,4]]] c(m) =if b[n] is prime then b[n]

%C Reverse digit set function that produces a prime sequence.

%t a={1, 3, 7, 9} digits=3*200 b=Table[Prime[n]*10+a[[4-Mod[n, 4]]], {n, 1, digits}] c=Table[If[PrimeQ[b[[n]]]==True, b[[n]], 0], {n, 1, digits}] d=Delete[Union[c], 1]

%K nonn

%O 0,1

%A _Roger L. Bagula_, Jan 05 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 22 22:13 EDT 2022. Contains 353959 sequences. (Running on oeis4.)