Number of set partitions of [3n] into n subsets of size three such that all element sums are triangular numbers.

A295946

Number of set partitions of [3n] into n subsets of size three such that all element sums are triangular numbers.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =2a(4) =17a(5) =149a(6) =1439a(7) =16993a(8) =373393a(9) =6899469a(10) =214746442a(11) =7287992421a(12) =249604374488

External references