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.

A183134 Square array A(n,k) by antidiagonals. A(n,k) is the number of length 2n k-ary words (n,k>=0), either empty or beginning with the first character of the alphabet, that can be built by repeatedly inserting doublets into the initially empty word.

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 5
18 10
19 1
20 0
21 1
22 1
23 7
24 29
25 35
26 1
27 0
28 1
29 1
30 9
31 58
32 181
33 126
34 1
35 0
36 1
37 1
38 11
39 97
40 523
41 1181
42 462
43 1
44 0
45 1
46 1
47 13
48 146
49 1145
50 4966
51 7941
52 1716
53 1
54 0
55 1
56 1
57 15
58 205
59 2131
60 14289
61 48838
62 54573
63 6435
64 1
65 0

List of values

[1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 3, 1, 0, 1, 1, 5, 10, 1, 0, 1, 1, 7, 29, 35, 1, 0, 1, 1, 9, 58, 181, 126, 1, 0, 1, 1, 11, 97, 523, 1181, 462, 1, 0, 1, 1, 13, 146, 1145, 4966, 7941, 1716, 1, 0, 1, 1, 15, 205, 2131, 14289, 48838, 54573, 6435, 1, 0]