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.

A236853 a(n) = Number of times n occurs in A234742.

Table of values

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

List of values

[1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 2, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 2, 1, 0, 0]