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.

A191822 Number of solutions to the Diophantine equation x1*x2 + x2*x3 + x3*x4 + x4*x5 = n, with all xi >= 1.

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 2
6 6
7 8
8 16
9 20
10 32
11 36
12 58
13 58
14 86
15 92
16 125
17 122
18 178
19 164
20 228
21 224
22 286
23 268
24 382
25 330
26 436
27 424
28 534
29 474
30 660
31 556
32 740
33 692
34 840
35 752
36 1043
37 846
38 1094
39 1032
40 1276
41 1078
42 1476
43 1204
44 1582
45 1458
46 1710
47 1480
48 2070
49 1628
50 2096
51 1924
52 2332
53 1946
54 2652
55 2148
56 2770
57 2480
58 2908
59 2480
60 3512

List of values

[0, 0, 0, 1, 2, 6, 8, 16, 20, 32, 36, 58, 58, 86, 92, 125, 122, 178, 164, 228, 224, 286, 268, 382, 330, 436, 424, 534, 474, 660, 556, 740, 692, 840, 752, 1043, 846, 1094, 1032, 1276, 1078, 1476, 1204, 1582, 1458, 1710, 1480, 2070, 1628, 2096, 1924, 2332, 1946, 2652, 2148, 2770, 2480, 2908, 2480, 3512]