close
login
A389802
The number of irreducible balanced subsets of [n].
10
1, 1, 2, 2, 3, 3, 6, 6, 11, 13, 20, 26, 41, 55, 74, 116, 141, 241, 258, 472, 473, 873, 828, 1576, 1447, 2821, 2472, 5072, 4183, 9173, 6976, 16520, 11403, 29223, 18332, 50686, 29219, 85763, 45842, 141280, 71211, 227223, 109510, 357228, 166325, 550167, 250256, 834094, 372701, 1248107, 550526, 1848942, 804191, 2721311, 1167102
OFFSET
1,3
COMMENTS
A proper subset of [n]={1..n} is called balanced if its mean value is also (n+1)/2, the overall mean value of [n]. A balanced subset is referred to as a reducible balanced subset if it contains a smaller balanced subset, otherwise, it is called an irreducible balanced subset.
EXAMPLE
For n=6, a(6)=3, since [6] has 3 irreducible balanced subsets: {1,6}, {2,5}, {3,4}.
For n=7, a(7)=6, since [7] has 6 irreducible balanced subsets: {4}, {1,7}, {2,6}, {3,5}, {1,5,6}, {2,3,7}.
PROG
(Python)
from itertools import combinations
def A389802(n):
if n<3: return 1
b, c = [], 0
for i in (range(1, n) if n&1 else range(2, n, 2)):
j = i*(n+1)
for p in combinations(range(1, n+1), i):
if sum(p)<<1 == j:
q = set(p)
for r in b:
if r <= q:
break
else:
b.append(q)
c += 1
return c # Chai Wah Wu, Oct 23 2025
CROSSREFS
Cf. A389803 (odd bisection), A389804 (even bisection).
Cf. A389805.
Sequence in context: A238547 A325681 A116450 * A054172 A236971 A383507
KEYWORD
nonn
AUTHOR
Hu Junhua, Oct 15 2025
EXTENSIONS
a(29)-a(36) from Sean A. Irvine, Oct 21 2025
a(37)-a(39) from Chai Wah Wu, Oct 23 2025
a(40)-a(75) from Christian Sievers, Oct 25 2025
STATUS
approved