Number of ways of partitioning the set of the first n positive triangular numbers into two subsets whose sums differ at most by 1.

A308682

Number of ways of partitioning the set of the first n positive triangular numbers into two subsets whose sums differ at most by 1.

Terms

    a(0) =1a(1) =1a(2) =0a(3) =0a(4) =1a(5) =1a(6) =1a(7) =1a(8) =2a(9) =7a(10) =6a(11) =8a(12) =13a(13) =42a(14) =33a(15) =52a(16) =105a(17) =318a(18) =310a(19) =485a(20) =874a(21) =3281a(22) =2974a(23) =5240a(24) =9488a(25) =34233a(26) =30418a(27) =55715a(28) =104730a(29) =378529

External references