Skip to main content
MathOverflow

Return to Answer

obligatory disclosure added (see https://mathoverflow.net/help/promotion)
Source Link
Glorfindel
Glorfindel
  • 2.8k
  • 6
  • 30
  • 39

We knows that no prime of the form $1\_2\_...\_n$ has been found yet... at least for $n$ up to $10^6$ (see https://mathworld.wolfram.com/SmarandachePrime.html).

Now, a partial answer to your question is given by OEIS, see sequences $A176942$ and $A071620$, while the list of the first $31$ primes of the requested form was given by Ripàme in 2011 (see https://vixra.org/pdf/1101.0092v2.pdf, pages 6 to 8), and they are listed in the OEIS sequence $A181129$.

Lastly, it is interesting to note that an efficient sieve criterion, able to efficiently skim the composite terms of the OEIS sequence $A001292$, is described in my article Ripà M. (2012), "Patterns related to the Smarandache circular sequence primality problem", Notes on Number Theory and Discrete Mathematics, vol. 18(1), pp. 29-48.

We knows that no prime of the form $1\_2\_...\_n$ has been found yet... at least for $n$ up to $10^6$ (see https://mathworld.wolfram.com/SmarandachePrime.html).

Now, a partial answer to your question is given by OEIS, see sequences $A176942$ and $A071620$, while the list of the first $31$ primes of the requested form was given by Ripà in 2011 (see https://vixra.org/pdf/1101.0092v2.pdf, pages 6 to 8), and they are listed in the OEIS sequence $A181129$.

Lastly, it is interesting to note that an efficient sieve criterion, able to efficiently skim the composite terms of the OEIS sequence $A001292$, is described in Ripà M. (2012), "Patterns related to the Smarandache circular sequence primality problem", Notes on Number Theory and Discrete Mathematics, vol. 18(1), pp. 29-48.

We knows that no prime of the form $1\_2\_...\_n$ has been found yet... at least for $n$ up to $10^6$ (see https://mathworld.wolfram.com/SmarandachePrime.html).

Now, a partial answer to your question is given by OEIS, see sequences $A176942$ and $A071620$, while the list of the first $31$ primes of the requested form was given by me in 2011 (see https://vixra.org/pdf/1101.0092v2.pdf, pages 6 to 8), and they are listed in the OEIS sequence $A181129$.

Lastly, it is interesting to note that an efficient sieve criterion, able to efficiently skim the composite terms of the OEIS sequence $A001292$, is described in my article Ripà M. (2012), "Patterns related to the Smarandache circular sequence primality problem", Notes on Number Theory and Discrete Mathematics, vol. 18(1), pp. 29-48.

Source Link
Marco Ripà
Marco Ripà
  • 2k
  • 7
  • 24

We knows that no prime of the form $1\_2\_...\_n$ has been found yet... at least for $n$ up to $10^6$ (see https://mathworld.wolfram.com/SmarandachePrime.html).

Now, a partial answer to your question is given by OEIS, see sequences $A176942$ and $A071620$, while the list of the first $31$ primes of the requested form was given by Ripà in 2011 (see https://vixra.org/pdf/1101.0092v2.pdf, pages 6 to 8), and they are listed in the OEIS sequence $A181129$.

Lastly, it is interesting to note that an efficient sieve criterion, able to efficiently skim the composite terms of the OEIS sequence $A001292$, is described in Ripà M. (2012), "Patterns related to the Smarandache circular sequence primality problem", Notes on Number Theory and Discrete Mathematics, vol. 18(1), pp. 29-48.