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.

A111775 Number of ways n can be written as a sum of at least three consecutive integers.

Table of values

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

List of values

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