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.

A320264 Number T(n,k) of proper multisets of nonempty words with a total of n letters over k-ary alphabet such that all k letters occur at least once in the multiset; triangle T(n,k), n>=2, 1<=k<=n-1, read by rows.

Table of values

n a(n)
2 1
3 1
4 2
5 3
6 11
7 9
8 4
9 38
10 84
11 52
12 7
13 125
14 523
15 766
16 365
17 10
18 364
19 2676
20 7096
21 7775
22 3006
23 16
24 1041
25 12435
26 52955
27 100455
28 87261
29 28357
30 22
31 2838
32 54034
33 348696
34 1020805
35 1497038
36 1074766
37 301064
38 32
39 7645
40 225417
41 2120284
42 8995801
43 19823964
44 23605043
45 14423564
46 3549177

List of values

[1, 1, 2, 3, 11, 9, 4, 38, 84, 52, 7, 125, 523, 766, 365, 10, 364, 2676, 7096, 7775, 3006, 16, 1041, 12435, 52955, 100455, 87261, 28357, 22, 2838, 54034, 348696, 1020805, 1497038, 1074766, 301064, 32, 7645, 225417, 2120284, 8995801, 19823964, 23605043, 14423564, 3549177]