Minimum number of possible solutions for all irreducible stick-cutting problems.

A022542

Minimum number of possible solutions for all irreducible stick-cutting problems.

Terms

    a(0) =0a(1) =0a(2) =0a(3) =2a(4) =3a(5) =6a(6) =8a(7) =18a(8) =26a(9) =78a(10) =94a(11) =342a(12) =388a(13) =1660a(14) =1728a(15) =8592a(16) =8616a(17) =45068a(18) =46848a(19) =267536a(20) =282816

External references