Number of partitions of the set of odd numbers {1, 3, ..., 2*n-1} into two subsets such that the absolute difference of the sums of the two subsets is minimized.
A290889
Number of partitions of the set of odd numbers {1, 3, ..., 2*n-1} into two subsets such that the absolute difference of the sums of the two subsets is minimized.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =1a(6) =5a(7) =4a(8) =13a(9) =10a(10) =38a(11) =34a(12) =118a(13) =103a(14) =380a(15) =346a(16) =1262a(17) =1153a(18) =4277a(19) =3965a(20) =14745a(21) =13746a(22) =51541a(23) =48396a(24) =182182a(25) =171835a(26) =650095a(27) =615966a(28) =2338706a(29) =2223755
External references
- oeis: A290889