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.

A285852 Rectangular array read by rows: T(n,k) is the number of words of length n on alphabet {0,1,2} that have exactly k records, n>=0, 0<=k<=3.

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 0
5 3
6 0
7 0
8 0
9 6
10 3
11 0
12 0
13 14
14 12
15 1
16 0
17 36
18 39
19 6
20 0
21 98
22 120
23 25
24 0
25 276
26 363
27 90
28 0
29 794
30 1092
31 301
32 0
33 2316
34 3279
35 966
36 0
37 6818
38 9840
39 3025
40 0
41 20196
42 29523
43 9330
44 0
45 60074
46 88572
47 28501
48 0
49 179196
50 265719
51 86526

List of values

[1, 0, 0, 0, 0, 3, 0, 0, 0, 6, 3, 0, 0, 14, 12, 1, 0, 36, 39, 6, 0, 98, 120, 25, 0, 276, 363, 90, 0, 794, 1092, 301, 0, 2316, 3279, 966, 0, 6818, 9840, 3025, 0, 20196, 29523, 9330, 0, 60074, 88572, 28501, 0, 179196, 265719, 86526]