login
A390771
a(n) is the minimal concatenation pq of two primes p <= q such that p + q = 2*n.
1
22, 33, 35, 37, 57, 77, 313, 513, 317, 319, 519, 323, 523, 723, 329, 331, 531, 731, 337, 537, 341, 343, 543, 347, 547, 747, 353, 553, 753, 359, 361, 561, 761, 367, 567, 371, 373, 573, 773, 379, 579, 383, 583, 783, 389, 589, 789, 1979, 397, 597, 797, 1789, 1197
OFFSET
2,1
LINKS
James S. DeArmon, R Code for A390771
EXAMPLE
a(2) = 22 because 2+2 = 4.
a(3) = 33 because 3+3 = 6.
a(8) = 313 because 3+13 = 16.
MAPLE
a:= n-> min(seq((l-> `if`(andmap(isprime, l),
parse(cat(l[])), [][]))([n-i, n+i]), i=0..n-2)):
seq(a(n), n=2..60); # Alois P. Heinz, Nov 28 2025
PROG
(R) # See DeArmon link.
(Python)
from sympy import isprime, sieve
def a(n): return min(int(str(p)+str(q)) for p in sieve.primerange(3, n+1) if isprime(q:=2*n-p)) if n > 2 else 22
print([a(n) for n in range(2, 55)]) # Michael S. Branicky, Dec 01 2025
CROSSREFS
KEYWORD
nonn,base
AUTHOR
James S. DeArmon, Nov 18 2025
STATUS
approved