login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A068830
Smallest member of the first occurrence of exactly n consecutive primes with all odd digits.
2
97, 31, 71, 191, 311, 53717, 3, 1137911, 3539995913, 379537751, 195513511313, 355993373513, 35795175733111, 139351331937113, 573737391997313
OFFSET
1,1
COMMENTS
a(16) > (10^16-1)/9. a(17) = 197351535173531. a(n) > (10^16-1)/9 for n >= 18. [Donovan Johnson, Sep 21 2010]
EXAMPLE
a(2) = 31, the two primes are 31 and 37. a(7) = 3 and the primes are 3, 5, 7, 11, 13, 17, and 19.
MATHEMATICA
id[n_] := IntegerDigits[n]; eodQ[n_, i_] := And @@ OddQ[Flatten[id[Table[NextPrime[n, k], {k, 0, i - 1}]]]] && Or @@ EvenQ[id[NextPrime[n, -1]]] && Or @@ EvenQ[id[NextPrime[n, i]]]; Table[n = 2; While[! eodQ[x = Prime[n], i], n++]; x, {i, 8}] (* Jayanta Basu, Aug 08 2013 *)
CROSSREFS
Sequence in context: A247384 A345528 A094498 * A033417 A182690 A088866
KEYWORD
hard,more,nonn,base
AUTHOR
Amarnath Murthy, Mar 09 2002
EXTENSIONS
1137911 from Larry Reeves (larryr(AT)acm.org), Oct 09 2003
a(9)-a(11) from Donovan Johnson, Apr 03 2008
a(12)-a(15) from Donovan Johnson, Sep 21 2010
STATUS
approved