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.

A330358 a(n) = n mod 5 + n mod 25 + ... + n mod 5^k, where 5^k <= n < 5^(k+1).

Table of values

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

List of values

[0, 0, 0, 0, 0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 0, 2, 4, 6, 8, 5, 7, 9, 11, 13, 10, 12, 14, 16, 18, 15, 17, 19, 21, 23, 20, 22, 24, 26, 28, 0, 2, 4, 6, 8, 5, 7, 9, 11, 13, 10, 12, 14, 16, 18, 15, 17, 19, 21, 23, 20, 22, 24, 26, 28, 0, 2, 4, 6, 8, 5, 7, 9, 11, 13, 10]