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.

A088673 a(n) = n mod A002024(n), where A002024 is "n appears n times": 1, 2, 2, 3, 3, 3, ...

Table of values

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

List of values

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