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.

A097355 Number of partitions of n into parts not greater than floor(log_2(n)).

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 3
5 3
6 4
7 4
8 10
9 12
10 14
11 16
12 19
13 21
14 24
15 27
16 64
17 72
18 84
19 94
20 108
21 120
22 136
23 150
24 169
25 185
26 206
27 225
28 249
29 270
30 297
31 321
32 831
33 918
34 1014
35 1115
36 1226
37 1342
38 1469
39 1602
40 1747
41 1898
42 2062
43 2233
44 2418
45 2611
46 2818
47 3034
48 3266
49 3507
50 3765
51 4033
52 4319
53 4616
54 4932

List of values

[1, 0, 1, 1, 3, 3, 4, 4, 10, 12, 14, 16, 19, 21, 24, 27, 64, 72, 84, 94, 108, 120, 136, 150, 169, 185, 206, 225, 249, 270, 297, 321, 831, 918, 1014, 1115, 1226, 1342, 1469, 1602, 1747, 1898, 2062, 2233, 2418, 2611, 2818, 3034, 3266, 3507, 3765, 4033, 4319, 4616, 4932]