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.

A133906 Least number m such that binomial(n+m, m) mod m = 1.

Table of values

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

List of values

[2, 3, 5, 2, 2, 7, 9, 2, 2, 3, 3, 2, 2, 17, 17, 2, 2, 3, 3, 2, 2, 23, 25, 2, 2, 4, 3, 2, 2, 31, 37, 2, 2, 8, 8, 2, 2, 3, 41, 2, 2, 4, 4, 2, 2, 3, 3, 2, 2, 5, 5, 2, 2, 3, 3, 2, 2, 4, 4, 2, 2, 67, 3, 2, 2, 44, 44, 2, 2, 16, 16, 2, 2, 3, 4, 2, 2, 5, 5, 2, 2, 3, 3, 2, 2, 89, 9, 2, 2, 3, 3, 2, 2, 97, 97, 2, 2, 7]