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 A359568 #35 Nov 18 2023 06:25:50 %S A359568 0,1,3,7,14,27,52 %N A359568 Maximum number of distinct folds after folding a square sheet of paper n times. %C A359568 All folds have to be straight and go from one edge of the paper to another edge and need to go through all layers of the paper stack on top of each other. If a previous fold is folded in half, it counts as two folds. But if multiple layers of paper are folded at the same time it still counts as only one fold. %C A359568 Found by hand. The next terms appear to be 101, 198, 391. %H A359568 Sean A. Irvine and S. Brunner, <a href="/A359568/a359568.txt">Additional comments from the author, replying to queries from an editor</a>. %H A359568 Rémy Sigrist, <a href="/A359568/a359568.png">Illustration for a(0) to a(3)</a>. %F A359568 Conjecture: a(n) = 2*a(n-1) + 4 - n, for n > 2. %e A359568 Folding instructions for all known terms. Repeat all previous steps for larger n: %e A359568 a(1)=1: Fold paper from left to right. %e A359568 a(2)=3: Fold from top to bottom. Slightly misalign the folding angle, so that the folds can be counted easier. %e A359568 a(3)=7: Fold top left corner down to center of paper. %e A359568 a(4)=14: Make a fold parallel to the previous fold and above the folded-down corner. %e A359568 a(5)=27: Make another fold parallel to the previous fold and repeat for all n > 5. %K A359568 nonn,more %O A359568 0,3 %A A359568 _S. Brunner_, Jan 06 2023