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.

A338940 a(n) is the number of solutions to the Diophantine equation p * x * (x + n) = y^2 with p = a*b a perfect square and a+b = n.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 1
6 1
7 0
8 1
9 0
10 3
11 0
12 1
13 1
14 1
15 4
16 2
17 1
18 2
19 0
20 3
21 0
22 1
23 0
24 4
25 4
26 3
27 0
28 1
29 1
30 12
31 0
32 3
33 0
34 3
35 4
36 2
37 1
38 1
39 4
40 12
41 1
42 4
43 0
44 1
45 7
46 1
47 0
48 7
49 0
50 10
51 4
52 3
53 1
54 3
55 4
56 4
57 0
58 3
59 0
60 12
61 1
62 1
63 0
64 4
65 16
66 4
67 0
68 3
69 0
70 12
71 0
72 7
73 1
74 3
75 14
76 1
77 0
78 12
79 0
80 21
81 0
82 3
83 0
84 4
85 16
86 1
87 4
88 4
89 1
90 21
91 4
92 1
93 0
94 1
95 4
96 10
97 1
98 2
99 0
100 10

List of values

[0, 0, 0, 0, 1, 1, 0, 1, 0, 3, 0, 1, 1, 1, 4, 2, 1, 2, 0, 3, 0, 1, 0, 4, 4, 3, 0, 1, 1, 12, 0, 3, 0, 3, 4, 2, 1, 1, 4, 12, 1, 4, 0, 1, 7, 1, 0, 7, 0, 10, 4, 3, 1, 3, 4, 4, 0, 3, 0, 12, 1, 1, 0, 4, 16, 4, 0, 3, 0, 12, 0, 7, 1, 3, 14, 1, 0, 12, 0, 21, 0, 3, 0, 4, 16, 1, 4, 4, 1, 21, 4, 1, 0, 1, 4, 10, 1, 2, 0, 10]