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.

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

Table of values

n a(n)
1 3
2 3
3 9
4 3
5 9
6 27
7 3
8 9
9 22
10 81
11 3
12 9
13 22
14 51
15 243
16 3
17 9
18 22
19 46
20 121
21 729
22 3
23 9
24 22
25 46
26 91
27 292
28 2187
29 3
30 9
31 22
32 46
33 86
34 183
35 704
36 6561
37 3
38 9
39 22
40 46
41 86
42 153
43 383
44 1691
45 19683
46 3
47 9
48 22
49 46
50 86
51 148
52 274
53 819
54 4059
55 59049
56 3
57 9
58 22
59 46
60 86
61 148
62 244
63 511
64 1749
65 9749
66 177147

List of values

[3, 3, 9, 3, 9, 27, 3, 9, 22, 81, 3, 9, 22, 51, 243, 3, 9, 22, 46, 121, 729, 3, 9, 22, 46, 91, 292, 2187, 3, 9, 22, 46, 86, 183, 704, 6561, 3, 9, 22, 46, 86, 153, 383, 1691, 19683, 3, 9, 22, 46, 86, 148, 274, 819, 4059, 59049, 3, 9, 22, 46, 86, 148, 244, 511, 1749, 9749, 177147]