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

Author

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

Keywords

• nonn

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.

Examples

			See Illustration in Links section.
		

Links

• Rémy Sigrist, Illustration of initial terms
• Rémy Sigrist, C# program for A342763

Crossrefs

Cf. A342759.