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.

A177338 Triangle read by rows: T(n,k) = 2^(n-tau(k)) mod n, where tau(.) is the number of divisors of its argument.

Table of values

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

List of values

[0, 0, 1, 1, 2, 2, 0, 0, 0, 2, 1, 3, 3, 4, 3, 2, 4, 4, 2, 4, 4, 1, 4, 4, 2, 4, 1, 4, 0, 0, 0, 0, 0, 0, 0, 0, 4, 2, 2, 1, 2, 5, 2, 5, 1, 2, 6, 6, 8, 6, 4, 6, 4, 8, 4, 1, 6, 6, 3, 6, 7, 6, 7, 3, 7, 6, 8, 4, 4, 8, 4, 4, 4, 4, 8, 4, 4, 4, 1, 7, 7, 10, 7, 5, 7, 5, 10, 5, 7, 11, 7, 2, 8, 8, 4, 8, 2, 8]