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.

A226873 Number A(n,k) of n-length words w over a k-ary alphabet {a1,a2,...,ak} such that #(w,a1) >= #(w,a2) >= ... >= #(w,ak) >= 0, where #(w,x) counts the letters x in word w; 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 3
13 1
14 0
15 1
16 1
17 3
18 4
19 1
20 0
21 1
22 1
23 3
24 10
25 11
26 1
27 0
28 1
29 1
30 3
31 10
32 23
33 16
34 1
35 0
36 1
37 1
38 3
39 10
40 47
41 66
42 42
43 1
44 0
45 1
46 1
47 3
48 10
49 47
50 126
51 222
52 64
53 1
54 0
55 1
56 1
57 3
58 10
59 47
60 246
61 522
62 561
63 163
64 1
65 0
66 1
67 1
68 3
69 10
70 47
71 246
72 882
73 1821
74 1647
75 256
76 1
77 0

List of values

[1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 3, 1, 0, 1, 1, 3, 4, 1, 0, 1, 1, 3, 10, 11, 1, 0, 1, 1, 3, 10, 23, 16, 1, 0, 1, 1, 3, 10, 47, 66, 42, 1, 0, 1, 1, 3, 10, 47, 126, 222, 64, 1, 0, 1, 1, 3, 10, 47, 246, 522, 561, 163, 1, 0, 1, 1, 3, 10, 47, 246, 882, 1821, 1647, 256, 1, 0]