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.

A077491 a(n) = smallest k such that 2k has digit sum = n.

Table of values

n a(n)
1 5
2 1
3 6
4 2
5 7
6 3
7 8
8 4
9 9
10 14
11 19
12 24
13 29
14 34
15 39
16 44
17 49
18 99
19 149
20 199
21 249
22 299
23 349
24 399
25 449
26 499
27 999
28 1499
29 1999
30 2499
31 2999
32 3499
33 3999
34 4499
35 4999
36 9999
37 14999
38 19999
39 24999
40 29999
41 34999
42 39999
43 44999
44 49999
45 99999
46 149999
47 199999
48 249999
49 299999

List of values

[5, 1, 6, 2, 7, 3, 8, 4, 9, 14, 19, 24, 29, 34, 39, 44, 49, 99, 149, 199, 249, 299, 349, 399, 449, 499, 999, 1499, 1999, 2499, 2999, 3499, 3999, 4499, 4999, 9999, 14999, 19999, 24999, 29999, 34999, 39999, 44999, 49999, 99999, 149999, 199999, 249999, 299999]