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.

A372286 a(n) = number of terms of A086893 that are in the interval [n, A371094(n)].

Table of values

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

List of values

[1, 5, 2, 4, 2, 7, 1, 2, 2, 4, 2, 3, 2, 6, 1, 3, 1, 4, 2, 3, 2, 9, 1, 2, 1, 3, 1, 2, 2, 4, 2, 2, 2, 4, 2, 3, 2, 6, 2, 3, 2, 4, 2, 3, 2, 5, 2, 3, 2, 4, 2, 3, 2, 8, 1, 2, 1, 3, 1, 3, 1, 5, 1, 3, 1, 3, 1, 3, 1, 6, 1, 3, 2, 4, 2, 3, 2, 5, 2, 3, 2, 4, 2, 3, 2, 11, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 5, 1, 2, 1, 3]