login
A342762
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) connected components.
2
1, 1, 1, 1, 1, 3, 5, 10, 20, 42, 86, 178, 362, 738, 1490, 3010, 6050, 12162, 24386, 48898, 97922, 196098, 392450, 785410, 1571330, 3143682, 6288386
OFFSET
0,6
COMMENTS
A342759 is the main sequence for this entry.
EXAMPLE
See illustration in Links section.
PROG
(C#) See Links section.
CROSSREFS
Cf. A342759.
It appears that a(n) = A135094(n-4) + 2 for n >= 5. Hugo Pfoertner, Mar 29 2021
Sequence in context: A182536 A158568 A068013 * A270737 A270724 A018104
KEYWORD
nonn,more
AUTHOR
STATUS
approved