|
|
A342874
|
|
Numbers k such that the k-th and (k+1)-st primes have the same digits.
|
|
1
|
|
|
293, 2106, 2161, 2763, 3698, 3793, 3812, 3922, 3959, 4000, 4205, 4224, 4260, 4728, 4953, 5065, 5283, 5617, 5700, 5751, 5932, 6326, 6333, 6422, 6539, 6623, 7375, 7475, 7501, 7533, 7542, 8306, 8568, 8751, 8777, 8994, 9102, 9259, 9354, 9480, 10389, 10700, 10791
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
prime(293) = 1913, while prime(294) = 1931. Thus, 293 is in this sequence.
|
|
MAPLE
|
q:= n-> (f-> is(f(n)=f(n+1)))(t-> sort(convert(ithprime(t), base, 10))):
|
|
MATHEMATICA
|
Select[Range[10000], Sort[IntegerDigits[Prime[#]]] == Sort[IntegerDigits[Prime[# + 1]]] &]
|
|
PROG
|
(PARI) upto(n) = {my(t = 1, res = List(), q = 2); forprime(p = 3, oo, if((p - q)%9 == 0 && vecsort(digits(q)) == vecsort(digits(p)), listput(res, t); ); q = p; t++; if(t > n, return(res) ) ) } \\ David A. Corneth, Mar 29 2021
(Python)
from sympy import nextprime
from itertools import count, islice
def agen():
p, pdigs, q, qdigs = 2, ["2"], 3, ["3"]
for k in count(1):
if pdigs == qdigs: yield k
p, q = q, nextprime(q)
pdigs, qdigs = qdigs, sorted(str(q))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|