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.

A141022 a(n) = n mod ((sum of digits of n)+1).

Table of values

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

List of values

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