Zak Seidov, <a href="/A058252/b058252_1.txt">Table of n, a(n) for n = 1..3000</a>
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”).
Zak Seidov, <a href="/A058252/b058252_1.txt">Table of n, a(n) for n = 1..3000</a>
proposed
approved
editing
proposed
Zak Seidov, <a href="/A058252/b058252_1.txt">Table of n, a(n) for n = 1..10003000</a>
approved
editing
reviewed
approved
proposed
reviewed
editing
proposed
If the primes are not required to be consecutive, the sequence starts 31, 241, 281, 311, 751, 911, 941, 1151, 1451, 2621, 4021, ... - Michael B. Porter, Jan 17 2013
reviewed
editing
proposed
reviewed
editing
proposed