[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.
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 A110448 A005508 * 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 WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified November 7 00:13 EST 2024. Contains 377523 sequences.
License Agreements, Terms of Use, Privacy Policy