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.

A242464 Number A(n,k) of n-length words w over a k-ary alphabet {a_1,...,a_k} such that w contains never more than j consecutive letters a_j (for 1<=j<=k); 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 2
8 0
9 0
10 1
11 3
12 3
13 0
14 0
15 1
16 4
17 8
18 4
19 0
20 0
21 1
22 5
23 15
24 21
25 5
26 0
27 0
28 1
29 6
30 24
31 56
32 54
33 7
34 0
35 0
36 1
37 7
38 35
39 115
40 208
41 140
42 9
43 0
44 0
45 1
46 8
47 48
48 204
49 550
50 773
51 362
52 12
53 0
54 0
55 1
56 9
57 63
58 329
59 1188
60 2631
61 2872
62 937
63 16
64 0
65 0
66 1
67 10
68 80
69 496
70 2254
71 6919
72 12584
73 10672
74 2425
75 21
76 0
77 0

List of values

[1, 1, 0, 1, 1, 0, 1, 2, 0, 0, 1, 3, 3, 0, 0, 1, 4, 8, 4, 0, 0, 1, 5, 15, 21, 5, 0, 0, 1, 6, 24, 56, 54, 7, 0, 0, 1, 7, 35, 115, 208, 140, 9, 0, 0, 1, 8, 48, 204, 550, 773, 362, 12, 0, 0, 1, 9, 63, 329, 1188, 2631, 2872, 937, 16, 0, 0, 1, 10, 80, 496, 2254, 6919, 12584, 10672, 2425, 21, 0, 0]