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.

A340129 a(n) is the number of solutions of the Diophantine equation x^2 + y^2 = z^5 + z, gcd(x, y, z) = 1, x <= y, where z = A008784(n).

Table of values

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

List of values

[1, 1, 2, 4, 2, 2, 4, 4, 2, 2, 4, 4, 4, 4, 4, 2, 4, 2, 2, 2, 16, 4, 4, 4, 2, 4, 2, 4, 4, 8, 8, 8, 4, 4, 4, 2, 8, 4, 16, 4, 16, 4, 2, 4, 16, 4, 4, 16, 4, 8, 8, 8, 4, 4, 8, 4, 8, 4, 4, 4, 16, 4, 4, 8, 2, 16, 2, 32, 2, 16, 4, 4, 2, 4, 8, 16, 4, 8, 4, 8, 4, 4, 8, 4, 16]