|
%I #17 Dec 23 2018 15:58:55
%S 36,72,105,144,195,200,255,288,315,324,345,385,392,400,450,495,525,
%T 576,585,648,675,735,784,800,805,825,855,882,900,945,975,1035,1152,
%U 1155,1295,1296,1305,1323,1365,1395,1425,1449,1463,1485,1547,1568,1575,1600,1645,1665,1755,1764,1785
%N Integers whose set of proper divisors, excluding 1, can be partitioned into two nonempty subsets having equal sum.
%C Called half-layered numbers in Behzadipour link.
%H Alois P. Heinz, <a href="/A322658/b322658.txt">Table of n, a(n) for n = 1..2000</a>
%H Hussein Behzadipour, <a href="https://arxiv.org/abs/1812.07233">Two-layered numbers</a>, arXiv:1812.07233 [math.NT], 2018.
%e 36 is a term with {2, 3, 4, 18} and B = {6, 9, 12} having equal sums 27.
%p a:= proc(n) option remember; local k, l, t, b; b:=
%p proc(m, i) option remember; m=0 or i>0 and
%p (b(m, i-1) or l[i]<=m and b(m-l[i], i-1)) end;
%p for k from 1+`if`(n=1, 1, a(n-1)) do
%p if isprime(k) then next fi;
%p l:= sort([(numtheory[divisors](k) minus {1, k})[]]);
%p t:= add(i, i=l);
%p if t::even then forget(b);
%p if b(t/2, nops(l)) then return k fi
%p fi
%p od
%p end:
%p seq(a(n), n=1..60); # _Alois P. Heinz_, Dec 22 2018
%t aQ[n_] := CompositeQ[n] && Module[{d = Rest[Most[Divisors[n]]], t, ds, x}, ds = Plus @@ d; If[Mod[ds, 2] > 0, False, t = CoefficientList[Product[1 + x^i, {i, d}], x]; t[[1 + ds/2]] > 0]]; Select[Range[2, 1785], aQ] (* _Amiram Eldar_, Dec 22 2018 after _T. D. Noe_ at A083207 *)
%o (PARI) part(n, v)=if(n<1, return(n==0)); forstep(i=#v, 2, -1, if(part(n-v[i], v[1..i-1]), return(1))); n==v[1];
%o is(n)=my(d=divisors(n), dd = select(x->((x>1) && (x<n)), d), s=sum(i=1, #dd, dd[i])); if (#dd, s%2==0 && part(s/2-vecmax(dd), dd[1..#dd-1])); \\ both after pari in A083207
%Y Cf. A083207, A246198, A322657.
%K nonn
%O 1,1
%A _Michel Marcus_, Dec 22 2018
|
