Map folding $(2 \times 3)$
The number of ways to fold a $2 \times 3$ map along its creases into a pile one square in size, counted by the order of the squares in the pile.
Value: $60$ lower bound Checked construction upper bound Literature
History
Each bound that improved on the earlier ones, with the record of its discovery and its best evidence. A bound is discovered in the literature, or by a certificate submitted here. Its best evidence is a certificate checked here, if there is one at least as strong: a formal proof in Lean (Lean proof) or an explicit construction checked by a program (Checked construction). Otherwise it's an Attested certificate, which someone else checked with a published checker, or the Literature. Submit a certificate.
| Date | Bound | Discovery | Best evidence |
|---|---|---|---|
| undated | $\ge 60$ |
Reference unknown
[via Number of ways of folding a 2 X n strip of stamps. - OEIS] |
Checked construction
Certificate map-folding-2-3-lower-60, submitted by daniel-munro, 2026-11-15 |
| undated | $\le 60$ |
Reference unknown
[via Number of ways of folding a 2 X n strip of stamps. - OEIS] |
Literature |