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.

A257213 Least d>0 such that floor(n/d) = floor(n/(d+1)).

Table of values

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

List of values

[1, 2, 3, 2, 3, 3, 4, 4, 3, 5, 4, 4, 5, 5, 5, 4, 6, 6, 5, 5, 7, 6, 6, 6, 5, 7, 7, 7, 6, 6, 8, 8, 7, 7, 7, 6, 8, 8, 8, 8, 7, 7, 9, 9, 9, 8, 8, 8, 7, 10, 9, 9, 9, 9, 8, 8, 10, 10, 10, 10, 9, 9, 9, 8, 11, 11, 10, 10, 10, 10, 9, 9, 11, 11, 11, 11, 11, 10, 10, 10]

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

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