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.

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

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 1
6 2
7 7
8 10
9 22
10 29
11 51
12 61
13 99
14 115
15 163
16 192
17 262
18 287
19 385
20 428
21 528
22 600
23 730
24 780
25 963
26 1054
27 1202
28 1337
29 1545
30 1646
31 1908
32 2059
33 2269
34 2516
35 2770
36 2933
37 3298
38 3568
39 3792
40 4142
41 4493
42 4786
43 5183
44 5562
45 5831
46 6423
47 6745
48 7140
49 7639
50 8231
51 8479
52 9216
53 9603
54 10260
55 10663
56 11488
57 11752
58 12838
59 13100
60 13887

List of values

[0, 0, 0, 0, 1, 2, 7, 10, 22, 29, 51, 61, 99, 115, 163, 192, 262, 287, 385, 428, 528, 600, 730, 780, 963, 1054, 1202, 1337, 1545, 1646, 1908, 2059, 2269, 2516, 2770, 2933, 3298, 3568, 3792, 4142, 4493, 4786, 5183, 5562, 5831, 6423, 6745, 7140, 7639, 8231, 8479, 9216, 9603, 10260, 10663, 11488, 11752, 12838, 13100, 13887]