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.

A095808 Number of ways to write n in the form m + (m+1) + ... + (m+k-1) + (m+k) + (m+k-1) + ... + (m+1) + m with integers m>= 1, k>=1. Or, number of divisors d of 4n-1 with 0 < (d-1)^2 < 4n.

Table of values

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

List of values

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