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.

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

Table of values

n a(n)
2 3
3 10
4 21
5 36
6 55
7 78
8 105
9 136
10 171
11 210
12 253
13 300
14 351
15 406
16 465
17 18
18 595
19 666
20 741
21 820
22 903
23 990
24 1081
25 1176
26 1275
27 1378
28 1485
29 1596
30 1711
31 1830
32 1953
33 2080
34 2211
35 4
36 2485
37 2628
38 2775
39 12
40 3081
41 3240
42 3403
43 3570
44 3741
45 3916
46 4095
47 4278
48 4465
49 4656
50 4851
51 60

List of values

[3, 10, 21, 36, 55, 78, 105, 136, 171, 210, 253, 300, 351, 406, 465, 18, 595, 666, 741, 820, 903, 990, 1081, 1176, 1275, 1378, 1485, 1596, 1711, 1830, 1953, 2080, 2211, 4, 2485, 2628, 2775, 12, 3081, 3240, 3403, 3570, 3741, 3916, 4095, 4278, 4465, 4656, 4851, 60]