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.
%I A367038 #30 Feb 20 2024 10:23:52 %S A367038 1,1,1,1,1,3,31,315434 %N A367038 Number of 2^n-page booklets that can be made with n folds. %C A367038 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. %H A367038 Matthew Scroggs, <a href="https://www.mscroggs.co.uk/blog/106">Zines</a>. %H A367038 Matthew Scroggs, <a href="https://github.com/mscroggs/zines/tree/main">Python script to generate sequence</a>. %e A367038 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. %K A367038 nonn,hard,more %O A367038 0,6 %A A367038 _Matthew Scroggs_, Nov 02 2023