A342760 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, we obtain a graph G(n); G(n) is contained with G(n+1); let H be the limit of G(n) as n tends to infinity; a(n) is the number of nodes of degree 1 or 3 that are at distance n from the origin in H; a(0) = 1.

1, 2, 3, 4, 6, 7, 9, 9, 10, 14, 19, 17, 16, 20, 20, 22, 23, 23, 29, 39, 27, 29, 32, 33, 38, 36, 36, 40, 38, 37, 45, 44, 42, 42, 47, 58, 63, 62, 59, 55, 50, 51, 54, 58, 55, 59, 74, 72, 73, 77, 64, 65, 72, 62, 67, 68, 61, 75, 80, 89, 75, 74, 70, 76, 76, 79, 79

Offset: 0

Author

Rémy Sigrist, Mar 30 2021

Keywords

• nonn

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, Colored representation of the nodes at distance <= 512 (where the color is function of the distance)
• Rémy Sigrist, C# program for A342760
• Index entries for coordination sequences

Crossrefs

Cf. A342759.