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.

A104515 Difference between the maximum number of consecutive integers and the least number >1 of consecutive integers, the sum of which equals 2n.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 3, 0, 0, 1, 0, 0, 4, 0, 0, 0, 3, 0, 4, 0, 0, 2, 0, 0, 4, 0, 5, 5, 0, 0, 4, 0, 0, 4, 0, 0, 7, 0, 0, 0, 5, 1, 4, 0, 0, 6, 8, 0, 4, 0, 0, 5, 0, 0, 7, 0, 8, 8, 0, 0, 4, 3, 0, 6, 0, 0, 8, 0, 9, 9, 0, 0, 7, 0, 0, 5, 8, 0, 4, 0, 0, 9, 11, 0, 4, 0, 8, 0, 0, 3, 9, 3, 0, 9, 0, 0]