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.

A187824 a(n) is the largest m such that n is congruent to -1, 0 or 1 mod k for all k from 1 to m.

Table of values

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

List of values

[3, 4, 5, 6, 3, 4, 4, 5, 3, 6, 4, 4, 3, 5, 5, 4, 3, 6, 5, 5, 3, 4, 6, 6, 3, 4, 4, 7, 3, 6, 4, 4, 3, 7, 7, 4, 3, 5, 5, 8, 3, 4, 5, 5, 3, 4, 4, 8, 3, 5, 4, 4, 3, 9, 5, 4, 3, 6, 6, 6, 3, 4, 5, 6, 3, 4, 4, 5, 3, 10, 4, 4, 3, 5, 5, 4, 3, 6, 5, 5, 3, 4, 7, 7, 3, 4, 4, 6, 3, 7, 4, 4, 3, 6, 6, 4, 3, 5, 5, 6, 3]