cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A367038 Number of 2^n-page booklets that can be made with n folds.

Original entry on oeis.org

1, 1, 1, 1, 1, 3, 31, 315434
Offset: 0

Views

Author

Matthew Scroggs, Nov 02 2023

Keywords

Comments

The number of ways that a piece of paper that's been folded in half n times can be cut and folded to make a booklet with 2^n pages. Rotations and reflections of a pattern are considered to be the same pattern.

Examples

			For n=5, there are a(5)=3 ways to fold a booklet with 2^5=32 pages. Diagrams showing these 3 ways are included at the first M. Scroggs link.