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.

A005421 Number of numbers of complexity n, i.e., that can be built from n ones using + and *, and require at least that many ones.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 3
7 2
8 6
9 6
10 7
11 14
12 16
13 20
14 34
15 42
16 56
17 84
18 108
19 152
20 214
21 295
22 398
23 569
24 763
25 1094
26 1475
27 2058
28 2878
29 3929
30 5493
31 7669
32 10501
33 14707
34 20476
35 28226
36 39287
37 54817
38 75619
39 105584
40 146910
41 203294
42 283764
43 394437
44 547485
45 763821
46 1061367
47 1476067
48 2057708
49 2861449

List of values

[1, 1, 1, 1, 2, 3, 2, 6, 6, 7, 14, 16, 20, 34, 42, 56, 84, 108, 152, 214, 295, 398, 569, 763, 1094, 1475, 2058, 2878, 3929, 5493, 7669, 10501, 14707, 20476, 28226, 39287, 54817, 75619, 105584, 146910, 203294, 283764, 394437, 547485, 763821, 1061367, 1476067, 2057708, 2861449]