cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

Table of values

n a(n)
0 1
1 2
2 3
3 4
4 6
5 7
6 9
7 9
8 10
9 14
10 19
11 17
12 16
13 20
14 20
15 22
16 23
17 23
18 29
19 39
20 27
21 29
22 32
23 33
24 38
25 36
26 36
27 40
28 38
29 37
30 45
31 44
32 42
33 42
34 47
35 58
36 63
37 62
38 59
39 55
40 50
41 51
42 54
43 58
44 55
45 59
46 74
47 72
48 73
49 77
50 64
51 65
52 72
53 62
54 67
55 68
56 61
57 75
58 80
59 89
60 75
61 74
62 70
63 76
64 76
65 79
66 79

List of values

[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]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.