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.

A060802 To weigh from 1 to n, make the heaviest weight as small as possible, under the condition of using fewest pieces of different, single weights; a(n) = weight of the heaviest weight.

Table of values

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

List of values

[1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 6, 7, 8, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 11, 12, 13, 14, 15, 16, 10, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15, 15, 16, 16, 17, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 18, 18, 18, 19, 19, 20, 20, 21]