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.

A261488 Number of triples (x, y, x mod y) such that x > y are divisors of n and x mod y is an anti-divisor of n.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 3, 0, 0, 0, 0, 2, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 2, 0, 3, 0, 1, 0, 0, 0, 0]