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.

A209240 Triangular array read by rows. T(n,k) is the number of ternary length-n words in which the longest run of consecutive 0's is exactly k; n>=0, 0<=k<=n.

Table of values

n a(n)
0 1
1 2
2 1
3 4
4 4
5 1
6 8
7 14
8 4
9 1
10 16
11 44
12 16
13 4
14 1
15 32
16 132
17 58
18 16
19 4
20 1
21 64
22 384
23 200
24 60
25 16
26 4
27 1
28 128
29 1096
30 668
31 214
32 60
33 16
34 4
35 1
36 256
37 3088
38 2180
39 740
40 216
41 60
42 16
43 4
44 1
45 512
46 8624
47 6992
48 2504
49 754
50 216
51 60
52 16
53 4
54 1
55 1024
56 23936
57 22128
58 8332
59 2576
60 756
61 216
62 60
63 16
64 4
65 1

List of values

[1, 2, 1, 4, 4, 1, 8, 14, 4, 1, 16, 44, 16, 4, 1, 32, 132, 58, 16, 4, 1, 64, 384, 200, 60, 16, 4, 1, 128, 1096, 668, 214, 60, 16, 4, 1, 256, 3088, 2180, 740, 216, 60, 16, 4, 1, 512, 8624, 6992, 2504, 754, 216, 60, 16, 4, 1, 1024, 23936, 22128, 8332, 2576, 756, 216, 60, 16, 4, 1]