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.

A125051 The sub-Fibonacci tree; a rooted tree in which every node with label k and parent node with label g has g child nodes that are assigned labels beginning with k+1 through k+g; the tree starts at generation n=0 with a root node labeled '1' and a child node labeled '2'.

Table of values

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

List of values

[1, 2, 3, 4, 5, 5, 6, 7, 6, 7, 8, 6, 7, 8, 9, 7, 8, 9, 10, 8, 9, 10, 11, 7, 8, 9, 10, 11, 8, 9, 10, 11, 12, 9, 10, 11, 12, 13, 7, 8, 9, 10, 11, 8, 9, 10, 11, 12, 9, 10, 11, 12, 13, 10, 11, 12, 13, 14, 8, 9, 10, 11, 12, 13, 9, 10, 11, 12, 13, 14, 10, 11, 12, 13, 14, 15, 11, 12, 13, 14, 15, 16, 9]