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.

A365686 Numbers k such that there exists a pair of integers (m,h) where 1 <= m < floor(sqrt(k)/2) <= h that satisfy Sum_{j=0..m} (k-j)^2 = Sum_{i=1..m} (h+i)^2.

Table of values

n a(n)
1 4
2 12
3 21
4 24
5 40
6 60
7 84
8 110
9 112
10 120
11 144
12 180
13 220
14 264
15 312
16 315
17 364
18 420
19 480
20 544
21 612
22 684
23 697
24 760
25 820
26 840
27 924
28 1012
29 1080
30 1104
31 1200
32 1265
33 1300
34 1404
35 1512
36 1624
37 1740
38 1860
39 1984
40 2106
41 2112
42 2244
43 2380
44 2520
45 2664
46 2812
47 2964
48 3120
49 3255

List of values

[4, 12, 21, 24, 40, 60, 84, 110, 112, 120, 144, 180, 220, 264, 312, 315, 364, 420, 480, 544, 612, 684, 697, 760, 820, 840, 924, 1012, 1080, 1104, 1200, 1265, 1300, 1404, 1512, 1624, 1740, 1860, 1984, 2106, 2112, 2244, 2380, 2520, 2664, 2812, 2964, 3120, 3255]