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.

A120987 Triangle read by rows: T(n,k) is the number of ternary words of length n with k strictly increasing runs (0 <= k <= n; for example, the ternary word 2|01|12|02|1|1|012|2 has 8 strictly increasing runs).

Table of values

n a(n)
0 1
1 0
2 3
3 0
4 3
5 6
6 0
7 1
8 16
9 10
10 0
11 0
12 15
13 51
14 15
15 0
16 0
17 6
18 90
19 126
20 21
21 0
22 0
23 1
24 77
25 357
26 266
27 28
28 0
29 0
30 0
31 36
32 504
33 1107
34 504
35 36
36 0
37 0
38 0
39 9
40 414
41 2304
42 2907
43 882
44 45
45 0
46 0
47 0
48 1
49 210
50 2850
51 8350
52 6765
53 1452
54 55
55 0
56 0
57 0
58 0
59 66
60 2277
61 14355
62 25653
63 14355
64 2277
65 66
66 0
67 0
68 0
69 0
70 12

List of values

[1, 0, 3, 0, 3, 6, 0, 1, 16, 10, 0, 0, 15, 51, 15, 0, 0, 6, 90, 126, 21, 0, 0, 1, 77, 357, 266, 28, 0, 0, 0, 36, 504, 1107, 504, 36, 0, 0, 0, 9, 414, 2304, 2907, 882, 45, 0, 0, 0, 1, 210, 2850, 8350, 6765, 1452, 55, 0, 0, 0, 0, 66, 2277, 14355, 25653, 14355, 2277, 66, 0, 0, 0, 0, 12]