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.

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

List of values

[1, 2, 2, 2, 1, 1, 2, 2, 2, 2, 3, 3, 2, 2, 2, 3, 2, 3, 4, 3, 4, 3, 4, 4, 4, 4, 6, 6, 5, 6, 4, 4, 6, 7, 7, 6, 7, 6, 5, 4, 6, 7, 8, 8, 8, 8, 10, 8, 8, 8, 9, 10, 8, 9, 11, 13, 11, 9, 12, 11, 10, 11, 11, 11, 13, 11, 14, 14, 13, 15, 17, 15, 16, 16, 16, 14, 14, 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.