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.

A091891 Number of partitions of n into parts which are a sum of exactly as many distinct powers of 2 as n has 1's in its binary representation.

Table of values

n a(n)
0 1
1 1
2 2
3 1
4 4
5 1
6 2
7 1
8 10
9 3
10 2
11 1
12 5
13 1
14 2
15 1
16 36
17 6
18 12
19 1
20 11
21 3
22 2
23 1
24 24
25 3
26 3
27 1
28 5
29 1
30 2
31 1
32 202
33 67
34 55
35 9
36 93
37 4
38 5
39 1
40 112
41 8
42 13
43 1
44 10
45 3
46 2
47 1
48 304
49 22
50 18
51 1
52 20
53 3
54 3
55 1
56 34
57 3
58 3
59 1
60 5
61 1
62 2
63 1
64 1828
65 1267
66 1456
67 71
68 1629
69 77
70 100
71 2
72 2342
73 99
74 123
75 9
76 132
77 4
78 3
79 1

List of values

[1, 1, 2, 1, 4, 1, 2, 1, 10, 3, 2, 1, 5, 1, 2, 1, 36, 6, 12, 1, 11, 3, 2, 1, 24, 3, 3, 1, 5, 1, 2, 1, 202, 67, 55, 9, 93, 4, 5, 1, 112, 8, 13, 1, 10, 3, 2, 1, 304, 22, 18, 1, 20, 3, 3, 1, 34, 3, 3, 1, 5, 1, 2, 1, 1828, 1267, 1456, 71, 1629, 77, 100, 2, 2342, 99, 123, 9, 132, 4, 3, 1]