home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.math
- Path: sparky!uunet!stanford.edu!leland.Stanford.EDU!ilan
- From: ilan@leland.Stanford.EDU (ilan vardi)
- Subject: Re: Folding numbers
- Message-ID: <1992Sep6.002207.28790@leland.Stanford.EDU>
- Sender: news@leland.Stanford.EDU (Mr News)
- Organization: DSG, Stanford University, CA 94305, USA
- References: <4958@balrog.ctron.com>
- Date: Sun, 6 Sep 92 00:22:07 GMT
- Lines: 18
-
- In article <4958@balrog.ctron.com> wilson@web.ctron.com (Dave Wilson) writes:
- >
- > Suppose we have a leaflet of N connected pages, e.g:
- >
- > +-------+-------+-------+- -+-------+-------+
- > | | | | | | |
- > | TITLE | 2 | 3 | ... | N-1 | N |
- > | | | | | | |
- > +-------+-------+-------+- -+-------+-------+
- >
- > Let f(N) be the number of ways to fold the leaflet along its
- > perforations to the size of a single page so that the title page
- > appears on top of the folded leaflet. I have computed the
-
- I think that this is known as the stamp folding problem and was
- studied by Touchard.
-
- -ilan
-