login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022542 Minimum number of possible solutions for all irreducible stick-cutting problems. 1

%I #8 May 19 2019 23:16:46

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

%T 267536,282816

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

%H F. Faase, <a href="http://www.iwriteiam.nl/cutsticks.html">The cutting sticks problem</a>

%H Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a022/A022542.java">Java program</a> (github)

%K nonn

%O 1,4

%A _Frans J. Faase_

%E Changed beginning, added one more term, May 15 1997

%E Offset corrected, a(1)-a(5) inserted, and a(21) added by _Sean A. Irvine_, May 19 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 06:52 EDT 2024. Contains 371920 sequences. (Running on oeis4.)