OFFSET
1,2
COMMENTS
Numbers congruent to {1, 2, 5, 6, 8, 9, 10, 13, 14} mod 16.
Also, numbers not of the form (j+k)*(3k-j) for j,k>0.
These numbers do not have any pair of divisors x, y such that x+y is a multiple of 4.
LINKS
Project Euler, Problem 135: Same Differences.
PROG
(Python)
isok = lambda n: (n & 15) in [1, 2, 5, 6, 8, 9, 10, 13, 14]
print([n for n in range(1, 256) if isok(n)])
CROSSREFS
KEYWORD
nonn
AUTHOR
Darío Clavijo, Apr 20 2025
STATUS
approved
