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.

A293108 Number A(n,k) of multisets of nonempty words with a total of n letters over k-ary alphabet such that within each prefix of a 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 3
13 3
14 0
15 1
16 1
17 3
18 6
19 5
20 0
21 1
22 1
23 3
24 7
25 15
26 7
27 0
28 1
29 1
30 3
31 7
32 19
33 31
34 11
35 0
36 1
37 1
38 3
39 7
40 20
41 48
42 73
43 15
44 0
45 1
46 1
47 3
48 7
49 20
50 53
51 131
52 155
53 22
54 0
55 1
56 1
57 3
58 7
59 20
60 54
61 157
62 348
63 351
64 30
65 0
66 1
67 1
68 3
69 7
70 20
71 54
72 163
73 455
74 954
75 755
76 42
77 0

List of values

[1, 1, 0, 1, 1, 0, 1, 1, 2, 0, 1, 1, 3, 3, 0, 1, 1, 3, 6, 5, 0, 1, 1, 3, 7, 15, 7, 0, 1, 1, 3, 7, 19, 31, 11, 0, 1, 1, 3, 7, 20, 48, 73, 15, 0, 1, 1, 3, 7, 20, 53, 131, 155, 22, 0, 1, 1, 3, 7, 20, 54, 157, 348, 351, 30, 0, 1, 1, 3, 7, 20, 54, 163, 455, 954, 755, 42, 0]