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.

A210635 Array read by descending antidiagonals: a(n,w) = ((w - (n mod w) - 1) + n) - (n mod w), n >= 0, w >= 1.

Table of values

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

List of values

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