OFFSET
1,1
COMMENTS
Some primes of sufficient length might be termed DNA primes if the sequence of digits 1,3,7,9 in any order happens to be an appropriate analog of the DNA bases A, G, C, T. It would be interesting to know if it is possible for any DNA sequence to match a DNA prime.
LINKS
Pierre Cami and Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 (first 5058 terms from Pierre Cami)
FORMULA
Select primes having digits 1, 3, 7, 9 only.
MATHEMATICA
Select[Flatten[Table[FromDigits/@Tuples[{1, 3, 7, 9}, n], {n, 4}]], PrimeQ] (* Harvey P. Dale, Jun 26 2015 *)
PROG
(Haskell)
a091633 n = a091633_list !! (n-1)
a091633_list = filter ((== 1) . a010051') a136333_list
-- Reinhard Zumkeller, Jul 17 2014
CROSSREFS
KEYWORD
easy,nonn,base
AUTHOR
Enoch Haga, Jan 26 2004
STATUS
approved