Number of maximal subsets of {1..n} such that every orderless pair of distinct elements has a different sum.
A325878
Number of maximal subsets of {1..n} such that every orderless pair of distinct elements has a different sum.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =4a(5) =5a(6) =8a(7) =22a(8) =40a(9) =56a(10) =78a(11) =124a(12) =222a(13) =390a(14) =616a(15) =892a(16) =1220a(17) =1620a(18) =2182a(19) =3042a(20) =4392a(21) =6364a(22) =9054a(23) =12608a(24) =16980a(25) =22244a(26) =28482a(27) =36208a(28) =45864a(29) =58692
External references
- oeis: A325878