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.

A111787 a(n) is the least k >= 3 such that n can be written as sum of k consecutive integers. a(n)=0 if such a k does not exist.

Table of values

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

List of values

[0, 0, 0, 0, 0, 3, 0, 0, 3, 4, 0, 3, 0, 4, 3, 0, 0, 3, 0, 5, 3, 4, 0, 3, 5, 4, 3, 7, 0, 3, 0, 0, 3, 4, 5, 3, 0, 4, 3, 5, 0, 3, 0, 8, 3, 4, 0, 3, 7, 5, 3, 8, 0, 3, 5, 7, 3, 4, 0, 3, 0, 4, 3, 0, 5, 3, 0, 8, 3, 5, 0, 3, 0, 4, 3, 8, 7, 3, 0, 5, 3, 4, 0, 3, 5, 4, 3, 11, 0, 3, 7, 8, 3, 4, 5, 3, 0, 7, 3, 5, 0, 3, 0, 13]