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.

A379604 a(n) is the maximum number of items in a bucket for the bucket sort algorithm with input {0, 1, ..., n-1} and B = floor(sqrt(n)) buckets.

Table of values

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

List of values

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