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.

A319495 Number T(n,k) of multisets of nonempty words with a total of n letters over k-ary alphabet such that for k>0 the k-th letter occurs at least once and within each word every letter of the alphabet is at least as frequent as the subsequent alphabet letter; 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 2
5 2
6 0
7 3
8 5
9 6
10 0
11 5
12 20
13 18
14 24
15 0
16 7
17 46
18 86
19 84
20 120
21 0
22 11
23 137
24 347
25 456
26 480
27 720
28 0
29 15
30 313
31 1216
32 2136
33 2940
34 3240
35 5040
36 0
37 22
38 836
39 4253
40 11128
41 15300
42 22200
43 25200
44 40320
45 0
46 30
47 1908
48 15410
49 44308
50 90024
51 127680
52 191520
53 221760
54 362880

List of values

[1, 0, 1, 0, 2, 2, 0, 3, 5, 6, 0, 5, 20, 18, 24, 0, 7, 46, 86, 84, 120, 0, 11, 137, 347, 456, 480, 720, 0, 15, 313, 1216, 2136, 2940, 3240, 5040, 0, 22, 836, 4253, 11128, 15300, 22200, 25200, 40320, 0, 30, 1908, 15410, 44308, 90024, 127680, 191520, 221760, 362880]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.