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.

A226874 Number T(n,k) of n-length words w over a k-ary alphabet {a1, a2, ..., ak} such that #(w,a1) >= #(w,a2) >= ... >= #(w,ak) >= 1, where #(w,x) counts the letters x in word w; 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 2
6 0
7 1
8 3
9 6
10 0
11 1
12 10
13 12
14 24
15 0
16 1
17 15
18 50
19 60
20 120
21 0
22 1
23 41
24 180
25 300
26 360
27 720
28 0
29 1
30 63
31 497
32 1260
33 2100
34 2520
35 5040
36 0
37 1
38 162
39 1484
40 6496
41 10080
42 16800
43 20160
44 40320
45 0
46 1
47 255
48 5154
49 20916
50 58464
51 90720
52 151200
53 181440
54 362880

List of values

[1, 0, 1, 0, 1, 2, 0, 1, 3, 6, 0, 1, 10, 12, 24, 0, 1, 15, 50, 60, 120, 0, 1, 41, 180, 300, 360, 720, 0, 1, 63, 497, 1260, 2100, 2520, 5040, 0, 1, 162, 1484, 6496, 10080, 16800, 20160, 40320, 0, 1, 255, 5154, 20916, 58464, 90720, 151200, 181440, 362880]