|
Search: id:A089689
|
|
|
| A089689 |
|
a={1,3,7,9} a1={0,1,3,7,9} b[n]=Flatten[Table[10*Sum[10^m*a1[[1+Mod[n+m,5]]],{m,0,n}]+a,{n,0,digits}]] a(m) = If b[n] is prime then b[n] |
|
+0
1
|
|
| 3, 7, 311, 313, 317, 9733, 9739, 10973, 10979, 31097317, 73109731091, 97310973101, 97310973103, 97310973109733, 7310973109731091, 73109731097310973109731097, 97310973109731097310973101
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
A sum method for producing a prime set based of two digits sets.
|
|
MAPLE
|
a={1, 3, 7, 9} a1={0, 1, 3, 7, 9} digits=100 b=Flatten[Table[10*Sum[10^m*a1[[1+Mod[n+m, 5]]], {m, 0, n}]+a, {n, 0, digits}]]; c=Table[If[PrimeQ[b[[n]]]==True, b[[n]], 0], {n, 1, Dimensions[b][[1]]}] d=Delete[Union[c], 1]
|
|
CROSSREFS
|
Sequence in context: A061422 A088097 A064774 this_sequence A103317 A104051 A128004
Adjacent sequences: A089686 A089687 A089688 this_sequence A089690 A089691 A089692
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jan 05 2004
|
|
|
Search completed in 0.002 seconds
|
