A342763 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 resulting graph has a(n) regions with minimal area.

1, 2, 2, 2, 3, 6, 10, 15, 27, 45, 85, 153, 297, 561, 1105, 2145, 4257, 8385, 16705, 33153, 66177, 131841, 263425, 525825, 1051137, 2100225, 4199425, 8394753, 16787457, 33566721, 67129345, 134242305, 268476417, 536920065, 1073823745, 2147581953, 4295131137

Offset

0,2

Comments

We count the regions whose area is 1/2^n that of the sheet of paper.

A342759 is the main sequence for this entry.

Links

Table of n, a(n) for n=0..36.

Rémy Sigrist, Illustration of initial terms

Rémy Sigrist, C# program for A342763

Example

See Illustration in Links section.

Prog

(C#) See Links section.

Crossrefs

Cf. A342759.

Sequence in context: A321380 A218694 A143596 * A091712 A125721 A049798

Adjacent sequences: A342760 A342761 A342762 * A342764 A342765 A342766

Keyword

nonn

Author

Rémy Sigrist and N. J. A. Sloane, Mar 21 2021

Status

approved