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.

A319498 Number T(n,k) of sets 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 1
5 2
6 0
7 2
8 5
9 6
10 0
11 2
12 16
13 18
14 24
15 0
16 3
17 39
18 80
19 84
20 120
21 0
22 4
23 106
24 323
25 432
26 480
27 720
28 0
29 5
30 245
31 1106
32 2052
33 2820
34 3240
35 5040
36 0
37 6
38 621
39 3822
40 10576
41 14820
42 21480
43 25200
44 40320
45 0
46 8
47 1431
48 13840
49 41896
50 86724
51 124440
52 186480
53 221760
54 362880

List of values

[1, 0, 1, 0, 1, 2, 0, 2, 5, 6, 0, 2, 16, 18, 24, 0, 3, 39, 80, 84, 120, 0, 4, 106, 323, 432, 480, 720, 0, 5, 245, 1106, 2052, 2820, 3240, 5040, 0, 6, 621, 3822, 10576, 14820, 21480, 25200, 40320, 0, 8, 1431, 13840, 41896, 86724, 124440, 186480, 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.