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.

A181371 Triangle read by rows: T(n,k) is the number of ternary words (i.e., finite sequences of 0's, 1's and 2's) of length n having k occurrences of 01's (0 <= k <= floor(n/2)).

Table of values

n a(n)
0 1
1 3
2 8
3 1
4 21
5 6
6 55
7 25
8 1
9 144
10 90
11 9
12 377
13 300
14 51
15 1
16 987
17 954
18 234
19 12
20 2584
21 2939
22 951
23 86
24 1
25 6765
26 8850
27 3573
28 480
29 15
30 17711
31 26195
32 12707
33 2305
34 130
35 1
36 46368
37 76500
38 43398
39 10008
40 855
41 18
42 121393
43 221016
44 143682
45 40426
46 4740
47 183
48 1
49 317811

List of values

[1, 3, 8, 1, 21, 6, 55, 25, 1, 144, 90, 9, 377, 300, 51, 1, 987, 954, 234, 12, 2584, 2939, 951, 86, 1, 6765, 8850, 3573, 480, 15, 17711, 26195, 12707, 2305, 130, 1, 46368, 76500, 43398, 10008, 855, 18, 121393, 221016, 143682, 40426, 4740, 183, 1, 317811]