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.

A268189 Triangle read by rows: T(n,k) is the number of partitions of n for which the sum of the parts larger than the smallest part is k (n>=1, 0<=k<=n-1).

Table of values

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

List of values

[1, 2, 0, 2, 0, 1, 3, 0, 1, 1, 2, 0, 1, 2, 2, 4, 0, 1, 1, 3, 2, 2, 0, 1, 2, 3, 3, 4, 4, 0, 1, 1, 3, 3, 6, 4, 3, 0, 1, 2, 2, 4, 5, 6, 7, 4, 0, 1, 1, 4, 2, 7, 5, 10, 8, 2, 0, 1, 2, 2, 4, 5, 7, 9, 12, 12, 6, 0, 1, 1, 3, 2, 7, 5, 11, 10, 17, 14, 2, 0, 1, 2, 3, 4, 4, 8, 8, 13, 15, 20, 21]