Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A022542
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A022542 Minimum number of possible solutions for all irreducible stick-cutting problems. +0
1
6, 8, 18, 26, 78, 94, 342, 388, 1660, 1728, 8592, 8616, 45068, 46848, 267536 (list; graph; listen)
OFFSET

0,1
LINKS

F. Faase, The cutting sticks problem

CROSSREFS

Sequence in context: A093479 A165720 A086913 this_sequence A108341 A028331 A113806

Adjacent sequences: A022539 A022540 A022541 this_sequence A022543 A022544 A022545

KEYWORD

nonn

AUTHOR

Frans Faase (Frans_LiXia(AT)wxs.nl)

EXTENSIONS

Changed beginning, added one more term, May 15 1997

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.

AT&T Labs Research

Legal Notice
© 2009 AT&T Intellectual Property. All Rights Reserved.