cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A347344 Positive integers k such that k with the first (most significant) digit repeated is prime.

Original entry on oeis.org

1, 13, 23, 27, 29, 31, 37, 43, 49, 57, 61, 73, 81, 83, 87, 91, 97, 103, 109, 117, 123, 129, 151, 153, 163, 171, 181, 187, 193, 203, 207, 213, 221, 237, 239, 243, 251, 267, 269, 273, 281, 287, 293, 297, 301, 307, 313, 319, 323, 329, 331, 343, 347, 359, 361
Offset: 1

Views

Author

Paolo Xausa, Aug 27 2021

Keywords

Comments

Conjecture: the sequence contains infinitely many twin prime pairs (k, k+2) such that (D(k), D(k+2)) is a twin prime pair, where D(x) = x with the most significant digit repeated. The first such k is 659: both (659, 661) and (6659, 6661) are twin prime pairs. All these k begin with either 3, 6, or 9.

Examples

			27 is a term because 227 is prime.
		

Crossrefs

Programs

  • Mathematica
    upto=500;Select[Range[1,upto,2],PrimeQ[FromDigits[Join[{First[d=IntegerDigits[#]]},d]]]&]
  • PARI
    isok(k) = my(d=digits(k)); isprime(eval(fromdigits(concat(d[1], d)))); \\ Michel Marcus, Sep 09 2021
  • Python
    from sympy import isprime
    def ok(n): s = str(n); return isprime(int(s[0] + s))
    print(list(filter(ok, range(362)))) # Michael S. Branicky, Aug 27 2021
    
Showing 1-1 of 1 results.