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.

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

Table of values

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

List of values

[5, 6, 7, 8, 9, 10, 5, 6, 6, 7, 7, 8, 5, 9, 6, 6, 7, 7, 5, 8, 8, 6, 6, 9, 5, 7, 7, 8, 6, 6, 5, 9, 7, 7, 7, 6, 5, 8, 8, 8, 7, 7, 5, 6, 9, 8, 8, 8, 5, 6, 6, 9, 9, 9, 5, 8, 6, 6, 7, 10, 5, 9, 9, 6, 6, 7, 5, 10, 10, 10, 6, 6, 5, 7, 7, 8, 11, 6, 5, 10, 7, 7, 7, 8, 5]

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

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