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.

A292712 Number A(n,k) of multisets of nonempty words with a total of n letters over k-ary alphabet such that within each word every letter of the alphabet is at least as frequent as the subsequent alphabet letter; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

n a(n)
0 1
1 1
2 0
3 1
4 1
5 0
6 1
7 1
8 2
9 0
10 1
11 1
12 4
13 3
14 0
15 1
16 1
17 4
18 8
19 5
20 0
21 1
22 1
23 4
24 14
25 25
26 7
27 0
28 1
29 1
30 4
31 14
32 43
33 53
34 11
35 0
36 1
37 1
38 4
39 14
40 67
41 139
42 148
43 15
44 0
45 1
46 1
47 4
48 14
49 67
50 223
51 495
52 328
53 22
54 0
55 1
56 1
57 4
58 14
59 67
60 343
61 951
62 1544
63 858
64 30
65 0
66 1
67 1
68 4
69 14
70 67
71 343
72 1431
73 3680
74 5111
75 1938
76 42
77 0

List of values

[1, 1, 0, 1, 1, 0, 1, 1, 2, 0, 1, 1, 4, 3, 0, 1, 1, 4, 8, 5, 0, 1, 1, 4, 14, 25, 7, 0, 1, 1, 4, 14, 43, 53, 11, 0, 1, 1, 4, 14, 67, 139, 148, 15, 0, 1, 1, 4, 14, 67, 223, 495, 328, 22, 0, 1, 1, 4, 14, 67, 343, 951, 1544, 858, 30, 0, 1, 1, 4, 14, 67, 343, 1431, 3680, 5111, 1938, 42, 0]