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.

A321519 Let d(n,i), i = 1..k be the k divisors of n^2 + 1 (the number 1 is not counted). a(n) is the number of ordered pairs d(n,i) < d(n,j) such that gcd(d(n,i), d(n,j)) = 1.

Table of values

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

List of values

[0, 0, 1, 0, 1, 0, 2, 1, 1, 0, 1, 1, 6, 0, 1, 0, 6, 2, 1, 0, 6, 1, 6, 0, 1, 0, 6, 1, 1, 1, 6, 2, 6, 1, 1, 0, 6, 2, 1, 0, 2, 1, 11, 1, 1, 1, 25, 1, 1, 1, 1, 1, 6, 0, 6, 0, 16, 1, 1, 1, 1, 1, 6, 1, 1, 0, 6, 3, 1, 2, 1, 6, 25, 0, 6, 1, 6, 1, 1, 1, 6, 2, 25, 0, 1, 1]