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.

A133908 Least odd prime number m such that binomial(n+m,m) mod m = 1.

Table of values

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

List of values

[3, 3, 5, 5, 7, 7, 11, 11, 3, 3, 3, 13, 17, 17, 17, 17, 19, 3, 3, 3, 23, 23, 29, 29, 5, 5, 3, 3, 3, 31, 37, 37, 37, 37, 37, 3, 3, 3, 41, 41, 43, 43, 47, 47, 3, 3, 3, 53, 7, 5, 5, 5, 5, 3, 3, 3, 59, 59, 61, 61, 67, 67, 3, 3, 3, 67, 71, 71, 71, 71, 73, 3, 3, 3, 5, 5, 5, 5, 5, 83, 3, 3, 3, 89, 89]