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

0, 0, 0, 2, 3, 6, 8, 18, 26, 78, 94, 342, 388, 1660, 1728, 8592, 8616, 45068, 46848, 267536, 282816

Offset: 1

Author

Frans J. Faase

Keywords

• nonn

Links

• F. Faase, The cutting sticks problem
• Sean A. Irvine, Java program (github)

Extensions

Changed beginning, added one more term, May 15 1997

Offset corrected, a(1)-a(5) inserted, and a(21) added by Sean A. Irvine, May 19 2019