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.

A286237 Triangular table: T(n,k) = 0 if k does not divide n, otherwise T(n,k) = P(phi(k), n/k), where P is sequence A000027 used as a pairing function N x N -> N, and phi is Euler totient function, A000010. Table is read by rows as T(1,1), T(2,1), T(2,2), etc.

Table of values

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

List of values

[1, 2, 1, 4, 0, 3, 7, 2, 0, 3, 11, 0, 0, 0, 10, 16, 4, 5, 0, 0, 3, 22, 0, 0, 0, 0, 0, 21, 29, 7, 0, 5, 0, 0, 0, 10, 37, 0, 8, 0, 0, 0, 0, 0, 21, 46, 11, 0, 0, 14, 0, 0, 0, 0, 10, 56, 0, 0, 0, 0, 0, 0, 0, 0, 0, 55, 67, 16, 12, 8, 0, 5, 0, 0, 0, 0, 0, 10, 79, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 78, 92, 22, 0, 0, 0, 0, 27, 0, 0, 0, 0, 0, 0, 21, 106, 0, 17, 0, 19, 0, 0, 0, 0, 0, 0, 0, 0, 0, 36]