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.

A061836 a(n) = smallest k>0 such that k+n divides k!.

Table of values

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

List of values

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