login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022542 Minimum number of possible solutions for all irreducible stick-cutting problems. 1
0, 0, 0, 2, 3, 6, 8, 18, 26, 78, 94, 342, 388, 1660, 1728, 8592, 8616, 45068, 46848, 267536, 282816 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Table of n, a(n) for n=1..21.

F. Faase, The cutting sticks problem

Sean A. Irvine, Java program (github)

CROSSREFS

Sequence in context: A281142 A005508 A110448 * A220418 A064450 A217137

Adjacent sequences:  A022539 A022540 A022541 * A022543 A022544 A022545

KEYWORD

nonn

AUTHOR

Frans J. Faase

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

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 13 06:26 EST 2019. Contains 329968 sequences. (Running on oeis4.)