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.

A263280 a(n) = A262507(n) - A263279(n); number of integers k > A259934(n) for which A155043(k) = n = A155043(A259934(n)).

Table of values

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

List of values

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