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.

A255361 Number of ways n can be represented as x*y+x+y where x>=y>1.

Table of values

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

List of values

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