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.

A257740 Number T(n,k) of 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>=0, 0<=k<=n, read by rows.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 2
5 3
6 0
7 3
8 14
9 13
10 0
11 5
12 49
13 114
14 73
15 0
16 7
17 148
18 672
19 1028
20 501
21 0
22 11
23 427
24 3334
25 9182
26 10310
27 4051
28 0
29 15
30 1170
31 15030
32 66584
33 129485
34 114402
35 37633
36 0
37 22
38 3150
39 63978
40 428653
41 1285815
42 1918083
43 1394414
44 394353
45 0
46 30
47 8288
48 261880
49 2557972
50 11117600
51 24917060
52 30044014
53 18536744
54 4596553

List of values

[1, 0, 1, 0, 2, 3, 0, 3, 14, 13, 0, 5, 49, 114, 73, 0, 7, 148, 672, 1028, 501, 0, 11, 427, 3334, 9182, 10310, 4051, 0, 15, 1170, 15030, 66584, 129485, 114402, 37633, 0, 22, 3150, 63978, 428653, 1285815, 1918083, 1394414, 394353, 0, 30, 8288, 261880, 2557972, 11117600, 24917060, 30044014, 18536744, 4596553]