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.

A221459 T(n,k)=Number of 0..k arrays of length n with each element unequal to at least one neighbor, with new values introduced in 0..k order.

Table of values

n a(n)
1 0
2 0
3 1
4 0
5 1
6 1
7 0
8 1
9 2
10 2
11 0
12 1
13 2
14 6
15 3
16 0
17 1
18 2
19 7
20 16
21 5
22 0
23 1
24 2
25 7
26 24
27 44
28 8
29 0
30 1
31 2
32 7
33 25
34 88
35 120
36 13
37 0
38 1
39 2
40 7
41 25
42 101
43 328
44 328
45 21
46 0
47 1
48 2
49 7
50 25
51 102
52 436
53 1235
54 896
55 34
56 0
57 1
58 2
59 7
60 25
61 102
62 455
63 1971
64 4668
65 2448
66 55
67 0
68 1
69 2
70 7
71 25
72 102
73 456
74 2192
75 9159
76 17675

List of values

[0, 0, 1, 0, 1, 1, 0, 1, 2, 2, 0, 1, 2, 6, 3, 0, 1, 2, 7, 16, 5, 0, 1, 2, 7, 24, 44, 8, 0, 1, 2, 7, 25, 88, 120, 13, 0, 1, 2, 7, 25, 101, 328, 328, 21, 0, 1, 2, 7, 25, 102, 436, 1235, 896, 34, 0, 1, 2, 7, 25, 102, 455, 1971, 4668, 2448, 55, 0, 1, 2, 7, 25, 102, 456, 2192, 9159, 17675]