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.

A159459 Rectangular array read by antidiagonals: a(n,m) = number of divisors of m that don't divide n.

Table of values

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

List of values

[0, 0, 1, 0, 0, 1, 0, 1, 1, 2, 0, 0, 0, 1, 1, 0, 1, 1, 2, 1, 3, 0, 0, 1, 0, 1, 2, 1, 0, 1, 0, 2, 1, 2, 1, 3, 0, 0, 1, 1, 0, 2, 1, 2, 2, 0, 1, 1, 2, 1, 3, 1, 3, 2, 3, 0, 0, 0, 0, 1, 0, 1, 1, 1, 2, 1, 0, 1, 1, 2, 1, 3, 1, 3, 2, 3, 1, 5, 0, 0, 1, 1, 1, 2, 0, 2, 2, 2, 1, 4, 1, 0, 1, 0, 2, 0, 2, 1, 3, 1, 2, 1, 4, 1, 3]