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.

A293112 Number A(n,k) of sets 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 1
9 0
10 1
11 1
12 2
13 2
14 0
15 1
16 1
17 2
18 5
19 2
20 0
21 1
22 1
23 2
24 6
25 10
26 3
27 0
28 1
29 1
30 2
31 6
32 14
33 23
34 4
35 0
36 1
37 1
38 2
39 6
40 15
41 39
42 51
43 5
44 0
45 1
46 1
47 2
48 6
49 15
50 44
51 104
52 111
53 6
54 0
55 1
56 1
57 2
58 6
59 15
60 45
61 129
62 284
63 243
64 8
65 0
66 1
67 1
68 2
69 6
70 15
71 45
72 135
73 386
74 775
75 530
76 10
77 0

List of values

[1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 2, 2, 0, 1, 1, 2, 5, 2, 0, 1, 1, 2, 6, 10, 3, 0, 1, 1, 2, 6, 14, 23, 4, 0, 1, 1, 2, 6, 15, 39, 51, 5, 0, 1, 1, 2, 6, 15, 44, 104, 111, 6, 0, 1, 1, 2, 6, 15, 45, 129, 284, 243, 8, 0, 1, 1, 2, 6, 15, 45, 135, 386, 775, 530, 10, 0]