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.

A212551 Number of partitions T(n,k) of n containing at least one other part m-k if m is the largest part; triangle T(n,k), n>=0, 0<=k<=n.

Table of values

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

List of values

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