proposed
approved
proposed
approved
editing
proposed
Many values of a(n) terms are numbers with two distinct prime divisors, exceptions being a(157) = 15465, a(254) = 25815, a(279) = 28695, a(303) = 31665, ... which have three prime distinct divisors, ...
proposed
editing
editing
proposed
a(5) = 26 because 26 = 2*13 => 26 mod (2+13) = 26 mod 15 = 11 = prime(5).
(Python)
from sympy import prime, primefactors
def a(n):
k, target = 2, prime(n)
while k%sum(primefactors(k)) != target: k += 1
return k
print([a(n) for n in range(1, 53)]) # Michael S. Branicky, Dec 10 2021
approved
editing
editing
approved
Many values of a(n) are numbers with two distinct prime divisors, except exceptions being a(157) = 15465, a(254) = 25815, a(279) = 28695, a(303) = 31665, ... with which have three prime distinct divisors, ...
proposed
editing
editing
proposed
A large majority Many values of a(n) are numbers with two distinct prime divisors, except a(157) = 15465, a(254) = 25815, a(279) = 28695, a(303) = 31665, ... with three prime distinct divisors, ...
reviewed
editing
proposed
reviewed