cp's OEIS Frontend

A342764 Fold a square sheet of paper alternately vertically to the left and horizontally downwards; after each fold, draw a line along each inward crease; after n folds, the largest region in the resulting graph occupies a(n)/2^n of the whole sheet.

%I A342764 #7 Mar 29 2021 15:16:36
%S A342764 1,1,2,4,7,13,26,51,97,191,366,713,1375,2673,5164,10031,19405,37663,
%T A342764 72922,141461,274019,531405,1029640,1996395,3868793,7500411,14536342,
%U A342764 28179521,54617039
%N A342764 Fold a square sheet of paper alternately vertically to the left and horizontally downwards; after each fold, draw a line along each inward crease; after n folds, the largest region in the resulting graph occupies a(n)/2^n of the whole sheet.
%C A342764 A342759 is the main sequence for this entry.
%C A342764 The sequence {a(n)/2^n, n >= 0} is bounded and weakly decreasing, hence it has a limit.
%H A342764 Rémy Sigrist, <a href="/A342764/a342764.png">Illustration of initial terms</a>
%H A342764 Rémy Sigrist, <a href="/A342764/a342764.txt">C# program for A342764</a>
%F A342764 a(n+1) <= 2*a(n).
%e A342764 See illustration in Links section.
%o A342764 (C#) See Links section.
%Y A342764 Cf. A342759.
%K A342764 nonn,more
%O A342764 0,3
%A A342764 _Rémy Sigrist_, Mar 24 2021