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.

A317746 Irregular triangle read by rows in which row n lists the divisors k of n such that k^n + n^k == 0 (mod k + n).

Table of values

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

List of values

[1, 1, 2, 1, 3, 1, 4, 1, 5, 1, 3, 6, 1, 7, 1, 2, 8, 1, 3, 9, 1, 10, 1, 11, 1, 4, 6, 12, 1, 13, 1, 7, 14, 1, 3, 5, 15, 1, 16, 1, 17, 1, 6, 9, 18, 1, 19, 1, 5, 20, 1, 3, 7, 21, 1, 22, 1, 23, 1, 3, 8, 12, 24, 1, 5, 25, 1, 13, 26, 1, 3, 9, 27, 1, 4, 28, 1, 29, 1, 6, 10, 15, 30]