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.

A266113 a(n) = number of integers k <= n which are least siblings in A263267-tree (see A266114).

Table of values

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

List of values

[1, 1, 2, 2, 3, 4, 5, 6, 7, 7, 8, 8, 9, 10, 10, 10, 11, 12, 13, 14, 14, 15, 16, 17, 18, 18, 19, 19, 20, 20, 21, 22, 22, 23, 24, 24, 25, 26, 26, 27, 28, 28, 29, 30, 30, 31, 32, 32, 33, 34, 35, 35, 36, 36, 36, 37, 38, 39, 40, 40, 41, 42, 42, 42, 43, 43, 44, 45, 45, 45, 46, 47, 48, 49, 49, 49, 50, 50, 51, 51, 52, 53, 54, 55, 55]