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.

A309079 For any n > 0: consider the strictly increasing finite sequences of integers whose concatenation of terms, in binary and without leading zeros, equals that of n; a(n) is the minimal sum of the terms of such a finite sequence.

Table of values

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

List of values

[1, 2, 3, 4, 5, 3, 4, 8, 9, 10, 5, 5, 6, 7, 8, 16, 17, 18, 19, 6, 7, 8, 9, 9, 10, 11, 6, 7, 8, 9, 10, 32, 33, 34, 35, 36, 9, 10, 11, 10, 11, 12, 13, 14, 15, 11, 12, 17, 18, 19, 20, 7, 8, 9, 10, 11, 12, 13, 14, 8, 9, 10, 11, 64, 65, 66, 67, 68, 69, 70, 71, 12]