login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A347038
Primes p such that there are no solutions to d(k+p) = sigma(k).
0
29, 37, 41, 53, 67, 89, 101, 109, 113, 127, 137, 151, 157, 173, 181, 197, 227, 229, 233, 257, 269, 277, 281, 293, 313, 349, 373, 389, 401, 409, 421, 439, 461, 557, 587, 593, 601, 613, 617, 641, 643, 653, 661, 673, 677, 701, 709, 739, 761, 773, 787, 821, 829
OFFSET
1,1
COMMENTS
If p is not in the sequence and d(k+p) = sigma(k), then k <= 1+2*sqrt(p). Proof: We have d(m) <= 2*sqrt(m) (see formula in A000005), so 2*sqrt(k+p) >= d(k+p) = sigma(k) >= k+1 (if k > 1). After squaring and simplifying, we get k <= 1+2*sqrt(p). - Pontus von Brömssen, Aug 20 2021
PROG
(Python)
from sympy import divisor_count as d, divisor_sigma as sigma, primerange
from math import isqrt
def A347038_list(pmax):
a = []
for p in primerange(2, pmax + 1):
if not any(d(k + p) == sigma(k) for k in range(1, 2 + isqrt(4 * p))):
a.append(p)
return a # Pontus von Brömssen, Aug 20 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Angad Singh, Aug 12 2021
STATUS
approved