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.

A047913 Triangle of numbers a(n,k) = number of partitions of k such that k = n + n_1 + n_2 + ... + n_t where n_1 <= 2n and n_{i+1} <= 2n_i for all i.

Table of values

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

List of values

[1, 1, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1, 2, 4, 5, 1, 1, 2, 4, 7, 9, 1, 1, 2, 4, 7, 12, 16, 1, 1, 2, 4, 7, 13, 22, 28, 1, 1, 2, 4, 7, 13, 24, 39, 50, 1, 1, 2, 4, 7, 13, 24, 42, 70, 89, 1, 1, 2, 4, 7, 13, 24, 43, 76, 126, 159, 1, 1, 2, 4, 7, 13, 24, 43, 78, 137, 225, 285]