login
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.
2
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,2
COMMENTS
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: A118944 A132988 A363997 * A244912 A249745 A114956
KEYWORD
nonn
AUTHOR
Rémy Sigrist, Mar 30 2021
STATUS
approved