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.

A115880 Largest positive x satisfying the Diophantine equation x^2 = y*(y+n), a(n)=0 if there are no solutions.

Table of values

n a(n)
1 0
2 0
3 2
4 0
5 6
6 4
7 12
8 3
9 20
10 12
11 30
12 8
13 42
14 24
15 56
16 15
17 72
18 40
19 90
20 24
21 110
22 60
23 132
24 35
25 156
26 84
27 182
28 48
29 210
30 112
31 240
32 63
33 272
34 144
35 306
36 80
37 342
38 180
39 380
40 99
41 420
42 220
43 462
44 120
45 506
46 264
47 552
48 143
49 600
50 312
51 650
52 168
53 702
54 364
55 756
56 195
57 812
58 420
59 870

List of values

[0, 0, 2, 0, 6, 4, 12, 3, 20, 12, 30, 8, 42, 24, 56, 15, 72, 40, 90, 24, 110, 60, 132, 35, 156, 84, 182, 48, 210, 112, 240, 63, 272, 144, 306, 80, 342, 180, 380, 99, 420, 220, 462, 120, 506, 264, 552, 143, 600, 312, 650, 168, 702, 364, 756, 195, 812, 420, 870]