A235482 -id:A235482 - cp's OEIS frontend

A235266 Primes whose base-2 representation is also the base-3 representation of a prime.

2, 7, 11, 13, 41, 47, 67, 73, 79, 109, 127, 151, 173, 181, 191, 193, 211, 223, 227, 229, 233, 251, 283, 331, 367, 421, 443, 487, 541, 557, 563, 587, 601, 607, 631, 641, 661, 677, 719, 733, 877, 941, 947, 967, 971, 1033, 1187, 1193, 1201, 1301, 1321, 1373, 1447, 1451, 1471, 1531, 1567, 1571, 1657, 1667, 1669, 1697, 1709, 1759

Offset: 1

M. F. Hasler, Jan 05 2014

Robert Israel, Table of n, a(n) for n = 1..10000
M. F. Hasler, Primes whose base c expansion is also the base b expansion of a prime

Cf. A090707 - A091924, A235461 - A235482. See the LINK for further cross-references.

Cf. A077717, A005836.

f:= proc(n) local L,i;
  L:= convert(n,base,2);
  isprime(add(L[i]*3^(i-1),i=1..nops(L)))
end proc:
select(f, [seq(ithprime(i),i=1..1000)]); # Robert Israel, Jun 03 2019

Select[Prime@ Range@ 250, PrimeQ@ FromDigits[IntegerDigits[#, 2], 3] &] (* Michael De Vlieger, Jun 03 2019 *)

is(p,b=3,c=2)=isprime(vector(#d=digits(p,c),i,b^(#d-i))*d~)&&isprime(p) \\ This code can be used for other bases b,c when b>c. See A235265 for code valid for b

forprime(p=2, 1e3, if(isprime(fromdigits(binary(p), 3)), print1(p", "))) \\ Charles R Greathouse IV, Mar 28 2022

from sympy import isprime, nextprime
def agen(): # generator of terms
    p = 2
    while True:
        p3 = sum(3**i for i, bi in enumerate(bin(p)[2:][::-1]) if bi=='1')
        if isprime(p3):
            yield p
        p = nextprime(p)
g = agen()
print([next(g) for n in range(1, 65)]) # Michael S. Branicky, Jan 16 2022

a(n) is the number whose base-3 representation is the base-2 representation of A235265(n).

A235265 Primes whose base-3 representation also is the base-2 representation of a prime.

Original entry on oeis.org

3, 13, 31, 37, 271, 283, 733, 757, 769, 1009, 1093, 2281, 2467, 2521, 2551, 2917, 3001, 3037, 3163, 3169, 3187, 3271, 6673, 7321, 7573, 9001, 9103, 9733, 19801, 19963, 20011, 20443, 20521, 20533, 20749, 21871, 21961, 22123, 22639, 22717, 27253, 28711, 28759, 29173, 29191, 59077, 61483, 61507, 61561, 65701, 65881

Offset: 1

M. F. Hasler, Jan 05 2014

This sequence and A235383 and A229037 are winners in the contest held at the 2014 AMS/MAA Joint Mathematics Meetings. - T. D. Noe, Jan 20 2014
This sequence was motivated by work initiated by V.J. Pohjola's post to the SeqFan list, which led to a clarification of the definition and correction of some errors, in sequences A089971, A089981 and A090707 through A090721. These sequences use "rebasing" (terminology of A065361) from some base b to base 10. Sequences A065720 - A065727 follow the same idea but use rebasing in the other sense, from base 10 to base b. The observation that only (10,b) and (b,10) had been considered so far led to the definition of this and related sequences: In a systematic approach, it seems natural to start with the smallest possible pairs of different bases, (2,3) and (3,2), then (2 <-> 4), (3 <-> 4), (2 <-> 5), etc.
Among the two possibilities using the smallest possible bases, 2 and 3, the present one seems a little bit more interesting, among others because not every base-3 representation is a valid base-2 representation (in contrast to the opposite case). This is also a reason why the present sequence grows much faster than the partner sequence A235266.

			3 = 10_3 and 10_2 = 2 is prime. 13 = 111_3 and 111_2 = 7 is prime.

Robert Israel, Table of n, a(n) for n = 1..10000
M. F. Hasler, Primes whose base c expansion is also the base b expansion of a prime
Veikko Pohjola, A090709 Decimal primes whose decimal representation in base 6 is also prime, SeqFan list, Jan 03 2014.

Subset of A077717.

Cf. A235266, A065720 and A036952, A065721 - A065727, A235394, A235395, A089971 and A020449, A089981, A090707 - A091924, A235461 - A235482. See M. F. Hasler's OEIS wiki page for further cross-references.

N:= 1000: # to get the first N terms
count:= 0:
for i from 1 while count < N do
   p2:= ithprime(i);
   L:= convert(p2,base,2);
   p3:= add(3^(j-1)*L[j],j=1..nops(L));
   if isprime(p3) then
      count:= count+1;
      A235265[count]:= p3;
   fi
od:
[seq(A235265[i], i=1..N)]; # Robert Israel, May 04 2014

b32pQ[n_]:=Module[{idn3=IntegerDigits[n,3]},Max[idn3]<2&&PrimeQ[ FromDigits[ idn3,2]]]; Select[Prime[Range[7000]],b32pQ] (* Harvey P. Dale, Apr 24 2015 *)

is(p,b=2,c=3)=vecmax(d=digits(p,c))

from sympy import isprime, nextprime
def agen(): # generator of terms
    p = 2
    while True:
        p3 = sum(3**i for i, bi in enumerate(bin(p)[2:][::-1]) if bi=='1')
        if isprime(p3):
            yield p3
        p = nextprime(p)
g = agen()
print([next(g) for n in range(1, 52)]) # Michael S. Branicky, Jan 16 2022

A235461 Primes whose base-4 representation also is the base 2-representation of a prime.

Original entry on oeis.org

5, 17, 257, 277, 337, 1093, 1109, 1297, 1361, 4357, 5189, 16453, 16657, 16661, 17489, 17669, 17681, 17749, 21521, 21569, 21589, 65537, 65557, 65617, 65809, 66821, 70657, 70981, 70997, 81937, 82241, 83221, 83269, 86017, 86357, 87317, 263429, 263489, 267541, 278549

Offset: 1

M. F. Hasler, Jan 11 2014

This sequence is part of the two-dimensional array of sequences based on this same idea for any two different bases b, c > 1. Sequence A235265 and A235266 are the most elementary ones in this list. Sequences A089971, A089981 and A090707 through A090721, and sequences A065720 - A065727, follow the same idea with one base equal to 10.
For further motivation and cross-references, see sequence A235265 which is the main entry for this whole family of sequences.
When the smaller base is b=2 such that only digits 0 and 1 are allowed, these are primes that are the sum of distinct powers of the larger base, here c=4, thus a subsequence of A077718 and therefore also of A000695, the Moser-de Bruijn sequence.

			5 = 11_4 and 11_2 = 3 are both prime, so 5 is a term.
17 = 101_4 and 101_2 = 5 are both prime, so 17 is a term.

Alois P. Heinz, Table of n, a(n) for n = 1..10000
M. F. Hasler, Primes whose base c expansion is also the base b expansion of a prime

Cf. A090707 - A091924, A235462 - A235482. See the LINK for further cross-references.

is(p,b=2,c=4)=vecmax(d=digits(p,c))

from itertools import islice
from sympy import nextprime, isprime
def A235461_gen(): # generator of terms
    p = 1
    while (p:=nextprime(p)):
        if isprime(m:=int(bin(p)[2:],4)):
            yield m
A235461_list = list(islice(A235461_gen(),20)) # Chai Wah Wu, Aug 21 2023

a(37)-a(40) from Robert Price, Nov 01 2023

A235615 Primes whose base-5 representation also is the base-4 representation of a prime.

Original entry on oeis.org

2, 3, 13, 41, 43, 61, 181, 191, 263, 281, 283, 331, 383, 431, 443, 463, 641, 643, 661, 881, 911, 1063, 1091, 1291, 1303, 1531, 1693, 2083, 2143, 2203, 2293, 2341, 3163, 3181, 3191, 3253, 3343, 3593, 3761, 3931, 4001, 4093, 4391, 4691, 4793, 5011, 5393, 5413, 5441, 6301

Offset: 1

M. F. Hasler, Jan 13 2014

This sequence is part of the two-dimensional array of sequences based on this same idea for any two different bases b, c > 1. Sequence A235265 and A235266 are the most elementary ones in this list. Sequences A089971, A089981 and A090707 through A090721, and sequences A065720 - A065727, follow the same idea with one base equal to 10.

			Both 13 = 23_5 and 23_4 = 11 are prime.

Robert Price, Table of n, a(n) for n = 1..107268
M. F. Hasler, Primes whose base c expansion is also the base b expansion of a prime

Cf. A235474, A235265, A235266, A152079, A235461 - A235482, A065720 - A065727, A235394, A235395, A089971 ⊂ A020449, A089981, A090707 - A091924, A235615 - A235639. See the LINK for further cross-references.

is(p,b=4,c=5)=vecmax(d=digits(p,c))

forprime(p=1,3e3,is(p,5,4)&&print1(vector(#d=digits(p,4),i,5^(#d-i))*d~,",")) \\ To produce the terms, this is more efficient than to select them using straightforwardly is(.)=is(.,4,5)

A235639 Primes whose base-9 representation is also the base-6 representation of a prime.

Original entry on oeis.org

2, 3, 5, 19, 23, 41, 113, 127, 131, 163, 199, 271, 419, 433, 739, 743, 761, 919, 991, 1009, 1013, 1063, 1153, 1171, 1459, 1481, 1499, 1553, 1567, 1571, 1733, 1747, 1783, 1873, 1913, 2237, 2377, 2381, 2539, 2557, 2593, 2633, 2939, 3011, 3079, 3083, 3187, 3259, 3331, 3659

Offset: 1

M. F. Hasler, Jan 13 2014

This sequence is part of the two-dimensional array of sequences based on this same idea for any two different bases b, c > 1. Sequence A235265 and A235266 are the most elementary ones in this list. Sequences A089971, A089981 and A090707 through A090721, and sequences A065720 - A065727, follow the same idea with one base equal to 10.

			19 = 21_9 and 21_6 = 13 are both prime, so 19 is a term.
509 = 625_9 and 625_6 = 17 are both prime, but 625 is not a valid base-6 integer, so 509 is not a term.

Robert Israel, Table of n, a(n) for n = 1..10000
M. F. Hasler, Primes whose base c expansion is also the base b expansion of a prime

Cf. A231481, A235265, A235266, A152079, A235461 - A235482, A065720 - A065727, A235394, A235395, A089971 ⊂ A020449, A089981, A090707 - A091924, A235615 - A235638. See the LINK for further cross-references.

R:= 2: x:= 2: count:= 1:
while count < 100 do
  x:= nextprime(x);
  L:= convert(x,base,6);
  y:= add(9^(i-1)*L[i],i=1..nops(L));
  if isprime(y) then count:= count+1; R:= R, y fi
od:
R; # Robert Israel, May 18 2020

is(p,b=6,c=9)=vecmax(d=digits(p,c))

forprime(p=1,3e3,is(p,9,6)&&print1(vector(#d=digits(p,6),i,9^(#d-i))*d~,",")) \\ To produce the terms, this is more efficient than to select them using straightforwardly is(.)=is(.,6,9)

A235475 Primes whose base-2 representation also is the base-5 representation of a prime.

Original entry on oeis.org

2, 7, 11, 13, 19, 41, 59, 127, 151, 157, 167, 173, 181, 191, 223, 233, 241, 271, 313, 331, 409, 421, 443, 463, 541, 563, 577, 607, 613, 641, 701, 709, 733, 743, 809, 859, 877, 919, 929, 953, 967, 991, 1021, 1033, 1069, 1087, 1193, 1259, 1373, 1423, 1451, 1453, 1471, 1483, 1493, 1549, 1697, 1753, 1759, 1783, 1787, 1831, 1877, 1979, 1993

Offset: 1

M. F. Hasler, Jan 12 2014

This sequence is part of a two-dimensional array of sequences, given in the LINK, based on this same idea for any two different bases b, c > 1. Sequence A235265 and A235266 are the most elementary ones in this list. Sequences A089971, A089981 and A090707 through A090721, and sequences A065720 - A065727, follow the same idea with one base equal to 10.

For further motivation and cross-references, see sequence A235265 which is the main entry for this whole family of sequences.

			7 = 111_2 and 111_5 = 31 are both prime, so 7 is a term.

Harvey P. Dale, Table of n, a(n) for n = 1..1000
M. F. Hasler, Primes whose base c expansion is also the base b expansion of a prime

Cf. A235266, A152079, A065720 ⊂ A036952, A065721 - A065727, A235394, A235395, A089971 ⊂ A020449, A089981, A090707 - A091924, A235461 - A235482. See the LINK for further cross-references.

Select[Prime[Range[400]],PrimeQ[FromDigits[IntegerDigits[#,2],5]]&] (* Harvey P. Dale, Jun 15 2019 *)

is(p,b=5,c=2)=isprime(vector(#d=digits(p,c),i,b^(#d-i))*d~)&&isprime(p) \\ This code is only valid for b>c.

A267769 Numbers whose base-9 representation is a square when read in base 10.

Original entry on oeis.org

0, 1, 4, 15, 23, 33, 58, 73, 81, 100, 121, 185, 213, 265, 298, 324, 361, 400, 474, 509, 555, 643, 685, 751, 861, 914, 1093, 1153, 1215, 1288, 1354, 1481, 1554, 1705, 1783, 1863, 1945, 2029, 2210, 2301, 2488, 2584, 2673, 2773, 2875, 3101, 3210, 3424, 3538, 3682, 3802, 4038, 4154, 4281, 4450

Offset: 1

M. F. Hasler, Jan 20 2016

Trivially includes powers of 81, since 81^k = 100..00_9 = 10^(2k) when read in base 10. Moreover, for any a(n) in the sequence, 81*a(n) is also in the sequence. One could call "primitive" the terms not of this form. These primitive terms include the subsequence 81^k + 2*9^k + 1 = (9^k+1)^2, k > 0, which yields A033934 when written in base 9.

Chai Wah Wu, Table of n, a(n) for n = 1..10000

Cf. A267763 - A267768 for bases 3 through 8. The base-2 analog is A000302 = powers of 4.

For a "prime" analog see also A235265, A235266, A152079, A235461 - A235482, A065720 ⊂ A036952, A065721 - A065727, A235394, A235395, A089971 ⊂ A020449, A089981, A090707 - A091924.

Select[Range[0, 5000], IntegerQ@ Sqrt@ FromDigits@ IntegerDigits[#, 9] &] (* Michael De Vlieger, Jan 24 2016 *)

is(n,b=9,c=10)=issquare(subst(Pol(digits(n,b)),x,c))

A267769_list = [int(s, 9) for s in (str(i**2) for i in range(10**6)) if max(s) < '9'] # Chai Wah Wu, Jan 20 2016

A235473 Primes whose base-3 representation is also the base-4 representation of a prime.

Original entry on oeis.org

2, 43, 61, 67, 97, 103, 127, 139, 151, 157, 199, 211, 229, 277, 283, 331, 337, 349, 373, 379, 433, 439, 463, 499, 523, 571, 601, 607, 727, 751, 787, 823, 853, 883, 919, 991, 1063, 1087, 1117, 1213, 1249, 1327, 1381, 1429, 1483, 1531, 1567, 1597, 1627, 1759, 1783, 1867, 1999

Offset: 1

M. F. Hasler, Jan 12 2014

This sequence is part of a two-dimensional array of sequences, given in the LINK, based on this same idea for any two different bases b, c > 1. Sequence A235265 and A235266 are the most elementary ones in this list. Sequences A089971, A089981 and A090707 through A090721, and sequences A065720 - A065727, follow the same idea with one base equal to 10.

This is a subsequence of A045331 and A045375.

			43 = 1121_3 and 1121_4 = 89 are both prime, so 43 is a term.

Harvey P. Dale, Table of n, a(n) for n = 1..1000
M. F. Hasler, Primes whose base c expansion is also the base b expansion of a prime

Cf. A235266, A235474, A152079, A235475 - A235479, A065720 ⊂ A036952, A065721 - A065727, A235394, A235395, A089971 ⊂ A020449, A089981, A090707 - A091924, A235461 - A235482. See the LINK for further cross-references.

Select[Prime[Range[400]],PrimeQ[FromDigits[IntegerDigits[#,3],4]]&] (* Harvey P. Dale, Oct 16 2015 *)

is(p,b=4,c=3)=isprime(vector(#d=digits(p,c),i,b^(#d-i))*d~)&&isprime(p) \\ Note: This code is only valid for b > c.

A267763 Numbers whose base-3 representation is a square when read in base 10.

Original entry on oeis.org

0, 1, 9, 16, 81, 100, 144, 235, 729, 784, 900, 961, 1296, 1369, 2115, 6561, 6724, 7056, 7225, 8100, 8649, 11664, 11881, 12321, 15985, 19035, 59049, 59536, 60516, 61009, 63504, 64009, 65025, 72900, 73441, 77841, 104976, 105625, 106929, 110889, 143865, 171315, 182428, 531441, 532900, 535824, 537289, 544644, 546121

Offset: 1

M. F. Hasler, Jan 20 2016

Trivially includes powers of 9, since 9^k = 100..00_3 = 10^(2k) when read as a base-10 number. Moreover, for any a(n) in the sequence, 9*a(n) is also in the sequence. One could call "primitive" the terms not of this form; these would be 1, 16 = 121_3, 100 = 10201_3, 235 = 22201_3, 784 = 1002001_3, 961 = 1022121_3, ... These primitive terms include the subsequence 9^k + 2*3^k + 1, k > 0, which yields A033934 when written in base 3.

Chai Wah Wu, Table of n, a(n) for n = 1..10000

Cf. A267764 - A267769 for bases 4 through 9. The base-2 analog is A000302 = powers of 4.

For a "prime" analog see also A235265, A235266, A152079, A235461 - A235482, A065720 ⊂ A036952, A065721 - A065727, A235394, A235395, A089971 ⊂ A020449, A089981, A090707 - A091924.

[n: n in [0..10^6] | IsSquare(Seqint(Intseq(n, 3)))]; // Vincenzo Librandi, Dec 28 2016

Select[Range[0, 600000], IntegerQ@Sqrt@FromDigits@IntegerDigits[#, 3] &] (* Vincenzo Librandi Dec 28 2016 *)

is(n,b=3,c=10)=issquare(subst(Pol(digits(n,b)),x,c))

A267763_list = [int(d,3) for d in (str(i**2) for i in range(10**6)) if max(d) < '3'] # Chai Wah Wu, Mar 12 2016

A235479 Primes whose base-2 representation also is the base-9 representation of a prime.

Original entry on oeis.org

11, 13, 19, 41, 79, 109, 137, 151, 167, 191, 193, 199, 227, 239, 271, 307, 313, 421, 431, 433, 457, 487, 491, 521, 563, 613, 617, 659, 677, 709, 727, 757, 929, 947, 1009, 1033, 1051, 1249, 1483, 1693, 1697, 1709, 1721, 1831, 1951, 1979, 1987, 1993

Offset: 1

M. F. Hasler, Jan 12 2014

This sequence is part of a two-dimensional array of sequences, given in the LINK, based on this same idea for any two different bases b, c > 1. Sequence A235265 and A235266 are the most elementary ones in this list. Sequences A089971, A089981 and A090707 through A090721, and sequences A065720 - A065727, follow the same idea with one base equal to 10.
For further motivation and cross-references, see sequence A235265 which is the main entry for this whole family of sequences.
A subsequence of A027697, A050150, A062090 and A176620.

			11 = 1011_2 and 1011_9 = 6571 are both prime, so 11 is a term.

Robert Price, Table of n, a(n) for n = 1..1958
M. F. Hasler, Primes whose base c expansion is also the base b expansion of a prime

Cf. A235466 ⊂ A077723, A235266, A152079, A235475 - A235478, A065720 ⊂ A036952, A065721 - A065727, A089971 ⊂ A020449, A089981, A090707 - A091924, A235394, A235395, A235461 - A235482. See the LINK for further cross-references.

is(p,b=9)=isprime(vector(#d=binary(p),i,b^(#d-i))*d~)&&isprime(p)

cp's OEIS Frontend

A235266 Primes whose base-2 representation is also the base-3 representation of a prime.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Python

Formula

A235265 Primes whose base-3 representation also is the base-2 representation of a prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Python

A235461 Primes whose base-4 representation also is the base 2-representation of a prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Python

Extensions

A235615 Primes whose base-5 representation also is the base-4 representation of a prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

PARI

A235639 Primes whose base-9 representation is also the base-6 representation of a prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

PARI

PARI

A235475 Primes whose base-2 representation also is the base-5 representation of a prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A267769 Numbers whose base-9 representation is a square when read in base 10.

Views

Author

Keywords

Comments

Links

Crossrefs