login
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.
2
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.
EXAMPLE
See Illustration in Links section.
PROG
(C#) See Links section.
CROSSREFS
Cf. A342759.
Sequence in context: A321380 A218694 A143596 * A091712 A125721 A049798
KEYWORD
nonn
AUTHOR
STATUS
approved