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.

A214965 Least m > 0 such that for every r and s in the set S = {{h*e} : h = 1,..,n} of fractional parts, if r < s, then r < k/m < s for some integer k; m is the least separator of S as defined at A001000.

Table of values

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

List of values

[2, 3, 4, 6, 6, 7, 11, 11, 11, 18, 18, 18, 18, 25, 25, 25, 25, 25, 25, 25, 25, 25, 32, 32, 32, 32, 32, 32, 32, 32, 32, 35, 35, 35, 39, 39, 39, 39, 55, 61, 61, 66, 68, 69, 69, 69, 70, 70, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71]

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

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