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.

A372727 Triangle read by rows: T(n, k) = n if k = 0, otherwise n - k*floor(n/k). The binary modulo operation.

Table of values

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

List of values

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