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.

A217954 T(n,k) = number of n-element 0..3 arrays with each element the minimum of k adjacent elements of a random 0..3 array of n+k-1 elements.

Table of values

n a(n)
1 4
2 4
3 16
4 4
5 16
6 64
7 4
8 16
9 50
10 256
11 4
12 16
13 50
14 144
15 1024
16 4
17 16
18 50
19 130
20 422
21 4096
22 4
23 16
24 50
25 130
26 310
27 1268
28 16384
29 4
30 16
31 50
32 130
33 296
34 736
35 3823
36 65536
37 4
38 16
39 50
40 130
41 296
42 624
43 1821
44 11472
45 262144
46 4
47 16
48 50
49 130
50 296
51 610
52 1289
53 4673
54 34350
55 1048576
56 4
57 16

List of values

[4, 4, 16, 4, 16, 64, 4, 16, 50, 256, 4, 16, 50, 144, 1024, 4, 16, 50, 130, 422, 4096, 4, 16, 50, 130, 310, 1268, 16384, 4, 16, 50, 130, 296, 736, 3823, 65536, 4, 16, 50, 130, 296, 624, 1821, 11472, 262144, 4, 16, 50, 130, 296, 610, 1289, 4673, 34350, 1048576, 4, 16]