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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089685 a={1,3,7,9} p[n]=Prime[n]*10+a[[1+Mod[n,4]]] a(m) = if p[n] is prime, then p[n] 0
23, 37, 59, 71, 113, 137, 179, 191, 233, 479, 593, 617, 733, 797, 839, 1039, 1093, 1279, 1373, 1499, 1511, 1637, 1931, 1973, 1997, 2273, 2297, 2339, 2579, 2693, 2833, 3079, 3319, 3371, 3539, 3673, 4019, 4091, 4217, 4637, 4679, 4999, 5639, 5879, 6079, 6131 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
A prime generator function based on the primes and the digit set {1,3,7,9}.
LINKS
MATHEMATICA
a={1, 3, 7, 9} digits=3*200 b=Table[Prime[n]*10+a[[1+Mod[n, 4]]], {n, 1, digits}] c=Table[If[PrimeQ[b[[n]]]==True, b[[n]], 0], {n, 1, digits}] d=Delete[Union[c], 1]
CROSSREFS
Sequence in context: A358421 A237766 A215163 * A186883 A068016 A338270
KEYWORD
nonn
AUTHOR
Roger L. Bagula, Jan 05 2004
STATUS
approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 15:28 EDT 2024. Contains 371254 sequences. (Running on oeis4.)