A map-folding problem

@inproceedings{Lunnon1968AMP,
  title={A map-folding problem},
  author={W. Fred Lunnon},
  year={1968}
}
An algorithm is described to compute the number of ways of folding a one-dimensional map, and a table of values given. Introduction. In how many ways can a map be folded up? What follows is restricted to the one-dimensional problem, that is : Given a plane chain ('map') of p equal segments ('leaves') jointed together, in how many ways ('p-foldings') G(p) can it be rigidly collapsed into one segment? For example G(3) = 6, (see the figures (1)(6) and the table (31)). In the figures, the free edge… CONTINUE READING