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.

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

Table of values

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

List of values

[4, 9, 25, 10, 26, 9, 9, 9, 6, 4, 4, 34, 34, 85, 289, 4, 4, 57, 87, 8, 8, 25, 25, 25, 134, 4, 4, 15, 15, 111, 111, 4, 4, 8, 8, 10, 10, 121, 121, 82, 86, 4, 4, 49, 49, 49, 49, 4, 4, 265, 68, 10, 10, 8, 8, 6, 9, 4, 4, 194, 194, 469, 249, 4, 4, 44, 44, 146, 146, 16, 16, 6, 6, 4, 4, 162]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.