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.

A261836 Number T(n,k) of compositions of n into distinct parts where each part i is marked with a word of length i over a k-ary alphabet whose letters appear in alphabetical order and all k letters occur at least once in the composition; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 1
6 0
7 3
8 10
9 7
10 0
11 3
12 15
13 21
14 9
15 0
16 5
17 40
18 96
19 92
20 31
21 0
22 11
23 183
24 832
25 1562
26 1305
27 403
28 0
29 13
30 266
31 1539
32 3908
33 4955
34 3090
35 757
36 0
37 19
38 549
39 4281
40 14791
41 26765
42 26523
43 13671
44 2873
45 0
46 27
47 1056
48 10902
49 50208
50 124450
51 178456
52 148638
53 66904
54 12607

List of values

[1, 0, 1, 0, 1, 1, 0, 3, 10, 7, 0, 3, 15, 21, 9, 0, 5, 40, 96, 92, 31, 0, 11, 183, 832, 1562, 1305, 403, 0, 13, 266, 1539, 3908, 4955, 3090, 757, 0, 19, 549, 4281, 14791, 26765, 26523, 13671, 2873, 0, 27, 1056, 10902, 50208, 124450, 178456, 148638, 66904, 12607]