Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A022541
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A022541 Related to number of irreducible stick-cutting problems. +0
1
0, 0, 0, 0, 0, 1, 4, 7, 9, 21, 41, 73, 147, 288, 557, 1111, 2193, 4343, 8728, 17483, 35063, 70828, 143267, 290193, 589705, 1200646, 2448904, 5005001 (list; graph; listen)
OFFSET

1,7
LINKS

F. Faase, Counting Hamilton cycles in product graphs

CROSSREFS

Adjacent sequences: A022538 A022539 A022540 this_sequence A022542 A022543 A022544

Sequence in context: A044903 A121865 A103073 this_sequence A063798 A084035 A103702

KEYWORD

nonn

AUTHOR

Frans Faase (Frans_LiXia(AT)wxs.nl)

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 October 13 20:18 EDT 2008. Contains 145016 sequences.

AT&T Labs Research

Legal Notice
© 2007 AT&T Knowledge Ventures. All Rights Reserved.