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.

A338260 a(n) is the number of nodes with depth of n in a binary tree defined as: root = 1 and a child (C) of a node (N) is such that A337978(C) = N. For nodes with two children, the smaller child is assigned as the left child and the bigger one as the right child. A child of a one-child node is assigned as the left child.

Table of values

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

List of values

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

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

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