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.

A303711 For any n > 0 and f > 0, let d_f(n) be the distance from n to the nearest number congruent mod f! to some divisor of f!; a(n) = Sum_{i > 0} d_i(n).

Table of values

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

List of values

[0, 0, 0, 1, 2, 0, 3, 0, 2, 3, 8, 0, 9, 4, 3, 6, 19, 8, 19, 4, 5, 11, 20, 0, 5, 12, 8, 5, 26, 0, 27, 6, 12, 19, 8, 4, 35, 24, 11, 5, 42, 10, 46, 13, 8, 26, 50, 8, 17, 18, 28, 29, 64, 16, 15, 8, 19, 41, 56, 0, 57, 30, 9, 14, 23, 27, 85, 36, 31, 15, 78, 12, 80]