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.

A238341 Triangle T(n,k) read by rows: T(n,k) is the number of compositions of n with exactly k occurrences of the largest part, n>=0, 0<=k<=n.

Table of values

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

List of values

[1, 0, 1, 0, 1, 1, 0, 3, 0, 1, 0, 6, 1, 0, 1, 0, 12, 3, 0, 0, 1, 0, 23, 7, 1, 0, 0, 1, 0, 46, 13, 4, 0, 0, 0, 1, 0, 91, 25, 10, 1, 0, 0, 0, 1, 0, 183, 46, 21, 5, 0, 0, 0, 0, 1, 0, 367, 89, 39, 15, 1, 0, 0, 0, 0, 1, 0, 737, 175, 70, 35, 6, 0, 0, 0, 0, 0, 1, 0, 1478, 351, 125, 71, 21, 1, 0, 0, 0, 0, 0, 1]