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.

A109631 Smallest number m such that n divides (10's complement factorial of m).

Table of values

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

List of values

[1, 2, 1, 2, 5, 2, 3, 2, 1, 5, 12, 2, 22, 3, 5, 4, 15, 2, 24, 5, 3, 12, 31, 2, 10, 22, 4, 3, 13, 5, 38, 6, 12, 15, 5, 2, 26, 24, 22, 5, 18, 3, 14, 12, 5, 31, 53, 4, 16, 10, 15, 22, 47, 4, 12, 3, 24, 13, 41, 5, 39, 38, 3, 6, 22, 12, 33, 15, 31, 5, 29, 2, 27, 26]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.