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.

A367315 a(1) = 1, and for any n > 0, a(2*n) is the number of k's among 1..n such that a(k) <= a(n), a(2*n+1) is the number of k's among 1..n such that a(k) >= a(n).

Table of values

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

List of values

[1, 1, 1, 2, 2, 3, 3, 4, 1, 5, 2, 6, 1, 7, 2, 8, 1, 4, 9, 10, 1, 7, 7, 12, 1, 5, 13, 14, 1, 9, 10, 16, 1, 6, 17, 14, 6, 19, 1, 20, 1, 7, 21, 19, 5, 20, 6, 24, 1, 8, 25, 18, 10, 27, 1, 28, 1, 9, 29, 26, 6, 28, 5, 32, 1, 10, 33, 22, 14, 35, 1, 34, 4, 23, 17, 38]