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.

A381438 Triangle read by rows where T(n>0,k>0) is the number of integer partitions of n whose section-sum partition ends with k.

Table of values

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

List of values

[1, 1, 1, 1, 0, 2, 2, 1, 0, 2, 3, 1, 0, 0, 3, 4, 1, 2, 0, 0, 4, 7, 2, 1, 0, 0, 0, 5, 9, 4, 1, 2, 0, 0, 0, 6, 13, 4, 4, 1, 0, 0, 0, 0, 8, 18, 6, 3, 2, 3, 0, 0, 0, 0, 10, 26, 9, 5, 2, 2, 0, 0, 0, 0, 0, 12, 32, 12, 8, 4, 2, 4, 0, 0, 0, 0, 0, 15]