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.

A269656 T(n,k) = number of length-n 0..k arrays with no adjacent pair x,x+1 repeated: infinite square array read by falling antidiagonals.

Table of values

n a(n)
1 2
2 3
3 4
4 4
5 9
6 8
7 5
8 16
9 27
10 15
11 6
12 25
13 64
14 79
15 26
16 7
17 36
18 125
19 253
20 225
21 42
22 8
23 49
24 216
25 621
26 988
27 626
28 64
29 9
30 64
31 343
32 1291
33 3065
34 3816
35 1710
36 93
37 10
38 81
39 512
40 2395
41 7686
42 15036
43 14596
44 4605
45 130
46 11
47 100
48 729
49 4089
50 16681
51 45590
52 73348
53 55344
54 12259
55 176
56 12
57 121

List of values

[2, 3, 4, 4, 9, 8, 5, 16, 27, 15, 6, 25, 64, 79, 26, 7, 36, 125, 253, 225, 42, 8, 49, 216, 621, 988, 626, 64, 9, 64, 343, 1291, 3065, 3816, 1710, 93, 10, 81, 512, 2395, 7686, 15036, 14596, 4605, 130, 11, 100, 729, 4089, 16681, 45590, 73348, 55344, 12259, 176, 12, 121]