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.

A213027 Number A(n,k) of 3n-length k-ary words, either empty or beginning with the first letter of the alphabet, that can be built by repeatedly inserting triples of identical letters into the initially empty word; square array A(n,k), n>=0, k>=0, 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 4
13 1
14 0
15 1
16 1
17 7
18 19
19 1
20 0
21 1
22 1
23 10
24 61
25 98
26 1
27 0
28 1
29 1
30 13
31 127
32 591
33 531
34 1
35 0
36 1
37 1
38 16
39 217
40 1810
41 6101
42 2974
43 1
44 0
45 1
46 1
47 19
48 331
49 4085
50 27631
51 65719
52 17060
53 1
54 0
55 1
56 1
57 22
58 469
59 7746
60 82593
61 441604
62 729933
63 99658
64 1
65 0

List of values

[1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 4, 1, 0, 1, 1, 7, 19, 1, 0, 1, 1, 10, 61, 98, 1, 0, 1, 1, 13, 127, 591, 531, 1, 0, 1, 1, 16, 217, 1810, 6101, 2974, 1, 0, 1, 1, 19, 331, 4085, 27631, 65719, 17060, 1, 0, 1, 1, 22, 469, 7746, 82593, 441604, 729933, 99658, 1, 0]