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.

A374015 Residue modulo 5 of n! divided by the highest power of 10 which divides n!.

Table of values

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

List of values

[1, 1, 2, 1, 4, 2, 2, 4, 2, 3, 3, 3, 1, 3, 2, 3, 3, 1, 3, 2, 4, 4, 3, 4, 1, 4, 4, 3, 4, 1, 3, 3, 1, 3, 2, 2, 2, 4, 2, 3, 2, 2, 4, 2, 3, 1, 1, 2, 1, 4, 2, 2, 4, 2, 3, 4, 4, 3, 4, 1, 1, 1, 2, 1, 4, 1, 1, 2, 1, 4, 3, 3, 1, 3, 2, 4, 4, 3, 4, 1, 3, 3, 1, 3, 2, 2, 2, 4, 2, 3, 2, 2, 4, 2, 3, 1, 1, 2, 1, 4, 4, 4, 3, 4, 1, 3]