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.

A115872 Square array where row n gives all solutions k > 0 to the cross-domain congruence n*k = A048720(A065621(n),k), zero sequence (A000004) if no such solutions exist.

Table of values

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

List of values

[1, 2, 1, 3, 2, 3, 4, 3, 6, 1, 5, 4, 7, 2, 7, 6, 5, 12, 3, 14, 3, 7, 6, 14, 4, 15, 6, 7, 8, 7, 15, 5, 28, 7, 14, 1, 9, 8, 24, 6, 30, 12, 15, 2, 15, 10, 9, 28, 7, 31, 14, 28, 3, 30, 7, 11, 10, 30, 8, 56, 15, 30, 4, 31, 14, 3, 12, 11, 31, 9, 60, 24, 31, 5, 60, 15, 6, 3, 13, 12, 48, 10, 62, 28, 56, 6, 62, 28, 12, 6, 5, 14, 13, 51, 11, 63, 30, 60, 7, 63, 30, 15, 7, 10, 7]