OFFSET
1,2
COMMENTS
Numbers whose divisors can be partitioned into two disjoint sets with equal sum when an extra 1-divisor is added to them. - Amiram Eldar, Jan 06 2025
Question: Does A156942 give all odd squares > 1 of this sequence? There are two issues here: first, whether there are any almost perfect numbers (k such that sigma(k) = 2k-1) that are odd (and by necessity squares) other than 1, and second, whether A103977(k) = 1 for all terms of A156942? The first 15000 terms of A156942 are all members.
LINKS
Robert Israel, Table of n, a(n) for n = 1..2500 (n = 1..430 from Antti Karttunen)
EXAMPLE
18 is included, as its divisors with an extra 1 are [1, 1, 2, 3, 6, 9, 18], and these can be partitioned as 2+3+6+9 = 1+1+18 = 20.
36 is included, as its divisors with an extra 1 are [1, 1, 2, 3, 4, 6, 9, 12, 18, 36], and these can be partitioned to two sets with equal sums, for example as (1+2+3+4)+(36) = (1+9)+(6+12+18), and also in several other ways (see example in A379504).
11025 is included as its divisors with an extra 1 are [1, 1, 3, 5, 7, 9, 15, 21, 25, 35, 45, 49, 63, 75, 105, 147, 175, 225, 245, 315, 441, 525, 735, 1225, 1575, 2205, 3675, 11025], and 1+5+35+175+245+11025 = 1+3+7+9+15+21+25+45+49+63+75+105+147+225+315+441+525+735+1225+1575+2205+3675 = 11486 = (sigma(11025)+1)/2.
MAPLE
KK:= proc(S) # Karmarkar-Karp algorithm
local R, n, a, b;
R:= S;
for n from nops(R) by -1 to 2 do
R:= sort([abs(R[-1]-R[-2]), op(R[1..-3])]);
od;
op(R) = 0
end proc:
filter:= proc(n) local S, t, d, R, i;
S:= [1, op(numtheory:-divisors(n))];
t:= convert(S, `+`)/2;
if t < n then return false fi;
if not t::integer then return false fi;
if KK(S) then return true fi;
evalb(coeff(mul(1+x^d, d=S), x, t) <> 0)
end proc;
select(filter, [$1..10000]); # Robert Israel, Jan 06 2025
CROSSREFS
KEYWORD
nonn,new
AUTHOR
Antti Karttunen, Jan 06 2025
STATUS
approved