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.

A072575 Triangle T(n,k) of number of compositions (ordered partitions) of n into distinct parts where largest part is exactly k, 1<=k<=n.

Table of values

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

List of values

[1, 0, 1, 0, 2, 1, 0, 0, 2, 1, 0, 0, 2, 2, 1, 0, 0, 6, 2, 2, 1, 0, 0, 0, 8, 2, 2, 1, 0, 0, 0, 6, 8, 2, 2, 1, 0, 0, 0, 6, 8, 8, 2, 2, 1, 0, 0, 0, 24, 12, 8, 8, 2, 2, 1, 0, 0, 0, 0, 30, 14, 8, 8, 2, 2, 1, 0, 0, 0, 0, 30, 36, 14, 8, 8, 2, 2, 1, 0, 0, 0, 0, 24, 36, 38, 14, 8, 8, 2, 2, 1, 0, 0, 0, 0, 24, 54, 42, 38, 14, 8, 8, 2, 2, 1]