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.

A338237 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 C - primepi(C) = N, or A062298(C) = N. For a node with two children, the smaller child is assigned as the left child and the bigger one as the right child. Otherwise, the child is assigned as the left child.

Table of values

n a(n)
0 1
1 2
2 4
3 6
4 8
5 11
6 15
7 18
8 24
9 30
10 36
11 46
12 54
13 66
14 78
15 94
16 110
17 130
18 154
19 179
20 205
21 240
22 278
23 317
24 365
25 418
26 474
27 539
28 612
29 692
30 783
31 885
32 993
33 1116
34 1254
35 1399
36 1570
37 1752
38 1950
39 2166
40 2408
41 2690
42 2976
43 3287
44 3644
45 4023
46 4449
47 4892
48 5391
49 5946
50 6523
51 7169

List of values

[1, 2, 4, 6, 8, 11, 15, 18, 24, 30, 36, 46, 54, 66, 78, 94, 110, 130, 154, 179, 205, 240, 278, 317, 365, 418, 474, 539, 612, 692, 783, 885, 993, 1116, 1254, 1399, 1570, 1752, 1950, 2166, 2408, 2690, 2976, 3287, 3644, 4023, 4449, 4892, 5391, 5946, 6523, 7169]