Map folding $(2 \times 10)$

The number of ways to fold a $2 \times 10$ map along its creases into a pile one square in size, counted by the order of the squares in the pile.

Value: $9381840$ (9,381,840) 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 9381840$ (9,381,840) Reference unknown
[via Number of ways of folding a 2 X n strip of stamps. - OEIS]
Literature
undated $\le 9381840$ (9,381,840) Reference unknown
[via Number of ways of folding a 2 X n strip of stamps. - OEIS]
Literature