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.

A381495 a(n) is the number of times n appears in A381466.

Table of values

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

List of values

[0, 2, 2, 1, 3, 1, 5, 2, 3, 2, 2, 0, 2, 0, 2, 1, 0, 1, 4, 2, 3, 2, 3, 1, 6, 0, 1, 0, 4, 0, 5, 2, 0, 1, 0, 1, 6, 0, 4, 1, 3, 2, 3, 1, 1, 0, 2, 1, 0, 0, 2, 2, 4, 1, 3, 0, 4, 1, 4, 1, 4, 1, 1, 3, 1, 4, 2, 0, 1, 1, 2, 1, 3, 0, 2, 3, 3, 1, 2, 3, 1, 1, 2, 1, 0, 0, 2, 1, 1, 2, 4, 0, 0, 2, 1, 0, 3, 0, 2, 1, 2, 1, 2, 0, 0, 0, 3, 2, 3, 0, 3, 1, 3, 1, 1, 2, 4, 1, 3, 1, 3, 0, 1, 0, 2, 1, 4, 1, 1, 1]