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.

A281152 Least number k such that Sum_{j=k..k+n-1}{j} = Sum_{j=k+n..t}{j}, for some t >= k+n.

Table of values

n a(n)
2 1
3 4
4 9
5 4
6 2
7 12
8 49
9 11
10 3
11 40
12 26
13 60
14 1
15 11
16 225
17 112
18 5
19 144
20 43
21 12
22 6
23 220
24 21
25 18
26 7
27 32
28 60
29 364
30 8
31 420
32 961
33 4
34 9
35 25
36 77
37 612
38 10
39 16
40 243
41 760
42 2
43 840
44 94
45 4
46 12
47 1012
48 165
49 81
50 13
51 52
52 111
53 1300
54 14
55 24
56 340
57 67
58 15
59 1624
60 9
61 1740
62 16
63 35
64 3969
65 46

List of values

[1, 4, 9, 4, 2, 12, 49, 11, 3, 40, 26, 60, 1, 11, 225, 112, 5, 144, 43, 12, 6, 220, 21, 18, 7, 32, 60, 364, 8, 420, 961, 4, 9, 25, 77, 612, 10, 16, 243, 760, 2, 840, 94, 4, 12, 1012, 165, 81, 13, 52, 111, 1300, 14, 24, 340, 67, 15, 1624, 9, 1740, 16, 35, 3969, 46]