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.

A243641 T(n,k)=Number of length n+2 0..k arrays with no three unequal elements in a row and new values 0..k introduced in 0..k order.

Table of values

n a(n)
1 4
2 4
3 8
4 4
5 9
6 16
7 4
8 9
9 21
10 32
11 4
12 9
13 21
14 50
15 64
16 4
17 9
18 21
19 51
20 120
21 128
22 4
23 9
24 21
25 51
26 127
27 289
28 256
29 4
30 9
31 21
32 51
33 127
34 323
35 697
36 512
37 4
38 9
39 21
40 51
41 127
42 324
43 835
44 1682
45 1024
46 4
47 9
48 21
49 51
50 127
51 324
52 844
53 2187
54 4060
55 2048
56 4
57 9
58 21
59 51
60 127
61 324
62 844
63 2242
64 5787
65 9801
66 4096
67 4

List of values

[4, 4, 8, 4, 9, 16, 4, 9, 21, 32, 4, 9, 21, 50, 64, 4, 9, 21, 51, 120, 128, 4, 9, 21, 51, 127, 289, 256, 4, 9, 21, 51, 127, 323, 697, 512, 4, 9, 21, 51, 127, 324, 835, 1682, 1024, 4, 9, 21, 51, 127, 324, 844, 2187, 4060, 2048, 4, 9, 21, 51, 127, 324, 844, 2242, 5787, 9801, 4096, 4]