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.

A071960 Largest k >= 0 such that Product_{i=0..k} (n+i) divides n!.

Table of values

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

List of values

[0, 0, 0, 0, 1, 0, 3, 2, 1, 0, 1, 0, 3, 2, 1, 0, 1, 0, 3, 2, 1, 0, 5, 4, 3, 2, 1, 0, 1, 0, 5, 4, 3, 2, 1, 0, 3, 2, 1, 0, 1, 0, 3, 2, 1, 0, 5, 4, 3, 2, 1, 0, 5, 4, 3, 2, 1, 0, 1, 0, 5, 4, 3, 2, 1, 0, 3, 2, 1, 0, 1, 0, 5, 4, 3, 2, 1, 0, 3, 2, 1, 0, 5, 4, 3, 2, 1, 0, 7, 6, 5, 4, 3, 2, 1, 0, 3, 2, 1, 0, 1, 0, 3, 2, 1]