|
| |
|
|
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
| |
|
|
79, 199, 293, 311, 379, 433, 613, 719, 977, 1013, 1031, 1097, 1319, 1993, 2111, 2239, 2293, 2399, 2417, 2713, 2819, 2837, 3119, 3137, 3677, 3733, 4099, 4339, 4397, 4799, 4877, 5039, 5231, 5419, 5477, 5573, 5717, 5939, 6311, 6473, 6599, 6733, 6917, 7013
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| Reverse digit set function that produces a prime sequence.
|
|
|
MATHEMATICA
| 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]
|
|
|
CROSSREFS
| Sequence in context: A191227 A142747 A142198 * A141964 A142285 A076815
Adjacent sequences: A089683 A089684 A089685 * A089687 A089688 A089689
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jan 05 2004
|
| |
|
|
