OFFSET
1,2
LINKS
Chai Wah Wu, Table of n, a(n) for n = 1..10000
PROG
(Python)
from sympy import divisors
import numpy as np
A175591 = []
for n in range(1, 10**6):
d = divisors(n)
s = sum(d)
if not s % 2 and 2*n <= s:
d.remove(n)
s2, ld = int(s/2-n), len(d)
z = np.zeros((ld+1, s2+1), dtype=int)
for i in range(1, ld+1):
y = min(d[i-1], s2+1)
z[i, range(y)] = z[i-1, range(y)]
z[i, range(y, s2+1)] = np.maximum(z[i-1, range(y, s2+1)], z[i-1, range(0, s2+1-y)]+y)
if z[i, s2] == s2:
A175591.append(s2)
break
# Chai Wah Wu, Aug 20 2014
CROSSREFS
KEYWORD
nonn
AUTHOR
Vladislav-Stepan Malakhovsky and Juri-Stepan Gerasimov, Jul 19 2010
EXTENSIONS
Inserted a(45) and corrected a(73) by Chai Wah Wu, Aug 20 2014
Name edited by Ivan N. Ianakiev, Jan 18 2020
STATUS
approved