login
This site is supported by donations 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. 0
6, 8, 18, 26, 78, 94, 342, 388, 1660, 1728, 8592, 8616, 45068, 46848, 267536 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Table of n, a(n) for n=0..14.

F. Faase, The cutting sticks problem

CROSSREFS

Sequence in context: A239396 A165720 A086913 * A108341 A173975 A199884

Adjacent sequences:  A022539 A022540 A022541 * A022543 A022544 A022545

KEYWORD

nonn

AUTHOR

Frans J. Faase

EXTENSIONS

Changed beginning, added one more term, May 15 1997

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified June 28 23:38 EDT 2017. Contains 288851 sequences.