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.

A224702 Number of partition sums between powers of 2 where the partition sums b(k) are A000070 and 2^n <= b(k) < 2^(n+1).

Table of values

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

List of values

[1, 1, 2, 1, 2, 1, 2, 2, 3, 2, 2, 3, 3, 3, 3, 3, 4, 4, 3, 4, 4, 5, 4, 5, 4, 5, 5, 5, 6, 5, 6, 5, 6, 6, 7, 6, 7, 6, 7, 7, 7, 7, 8, 7, 8, 8, 8, 8, 9, 8, 9, 9, 8, 10, 9, 9, 10, 9, 10, 10, 10, 11, 10, 11, 10, 11, 11, 11, 12, 11, 12, 11, 12, 12, 13, 12, 12, 13, 13, 13, 13, 13, 14, 13, 14]