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.

A091890 Number of partitions of n into sums of exactly three distinct powers of 2.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 2, 0, 0, 0, 1, 1, 1, 3, 2, 0, 1, 3, 3, 2, 5, 2, 1, 1, 5, 6, 3, 9, 5, 4, 5, 10, 9, 8, 13, 8, 10, 8, 16, 17, 15, 22, 18, 18, 20, 25, 28, 27, 34, 31, 32, 33, 44, 49, 44, 64, 53, 56, 61, 71, 77, 77, 100, 88, 94, 99, 123, 125, 132, 162, 147, 154]