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.

A204931 Least k such that n divides A204930(k), the k-th difference of two distinct factorials.

Table of values

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

List of values

[1, 3, 6, 3, 2, 6, 7, 10, 6, 15, 5, 10, 32, 13, 15, 10, 7, 6, 9, 15, 13, 5, 4, 10, 15, 32, 21, 28, 14, 15, 38, 10, 19, 13, 28, 21, 72, 9, 32, 15, 20, 13, 53, 19, 21, 25, 40, 10, 28, 15, 13, 32, 57, 21, 27, 28, 9, 14, 8, 15]