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.

A262836 {3,5}-primes (defined in Comments).

Original entry on oeis.org

2, 3, 5, 7, 17, 29, 31, 37, 41, 67, 79, 97, 101, 109, 139, 149, 151, 229, 269, 271, 311, 367, 457, 491, 701, 797, 829, 857, 911, 929, 977, 1039, 1129, 1181, 1231, 1381, 1429, 1481, 1637, 1759, 1861, 1949, 1951, 2011, 2281, 2297, 2467, 2521, 2557, 2659, 2671
Offset: 1

Views

Author

Clark Kimberling, Nov 05 2015

Keywords

Comments

Let S = {b(1), b(2), ..., b(k)}, where k > 1 and b(i) are distinct integers > 1 for j = 1..k. Call p an S-prime if the digits of p in base b(i) spell a prime in each of the bases b(j) in S, for i = 1..k. Equivalently, p is an S-prime if p is a strong-V prime (defined at A262729) for every permutation of the vector V = (b(1), b(2), ..., b(k)).

Crossrefs

Programs

  • Mathematica
    {b1, b2} = {3, 5};
    u = Select[Prime[Range[6000]], PrimeQ[FromDigits[IntegerDigits[#, b1], b2]] &]; (* A231474 *)
    v = Select[Prime[Range[6000]], PrimeQ[FromDigits[IntegerDigits[#, b2], b1]] &]; (* A262835 *)
    w = Intersection[u, v]; (* A262836 *)
    (* Peter J. C. Moses, Sep 27 2015 *)
Showing 1-1 of 1 results.