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.

A257212 Least d>0 such that floor(n/d) - floor(n/(d+1)) <= 1.

Table of values

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

List of values

[1, 1, 1, 2, 2, 2, 2, 2, 3, 2, 3, 3, 3, 3, 3, 4, 3, 3, 4, 4, 3, 4, 4, 4, 5, 4, 4, 4, 5, 5, 4, 4, 5, 5, 5, 4, 5, 5, 5, 5, 6, 6, 5, 5, 5, 6, 6, 6, 5, 5, 6, 6, 6, 6, 5, 7, 6, 6, 6, 6, 7, 7, 7, 6, 6, 6, 7, 7, 7, 7, 6, 6, 7, 7, 7, 7, 7, 6, 8, 8, 7, 7, 7, 7, 8, 8, 8]

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

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