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.

A317872 a(n) is the number of times that binomial(n+m, m) mod m = 1, for 0 < m <= n.

Table of values

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

List of values

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