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.

A224878 Number T(n,k) of partitions of n into distinct parts with boundary size k (where one part of size 0 is allowed).

Table of values

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

List of values

[1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 3, 0, 1, 2, 1, 0, 1, 3, 2, 0, 1, 5, 2, 0, 1, 4, 5, 0, 1, 4, 6, 1, 0, 1, 6, 8, 1, 0, 1, 7, 9, 3, 0, 1, 6, 13, 4, 0, 1, 7, 15, 7, 0, 1, 7, 18, 10, 0, 1, 8, 20, 14, 1, 0, 1, 11, 23, 17, 2, 0, 1, 8, 28, 24, 3, 0, 1, 9, 31, 30, 5, 0, 1]