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.

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

Author

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

Keywords

• nonn
• more

Comments

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 A342762

Crossrefs

Cf. A342759.

It appears that a(n) = A135094(n-4) + 2 for n >= 5. Hugo Pfoertner, Mar 29 2021