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.

A250277 T(n,k)=Number of length n+1 0..k arrays with the sum of the squares of adjacent differences multiplied by some arrangement of +-1 equal to zero.

Table of values

n a(n)
1 2
2 3
3 4
4 4
5 11
6 8
7 5
8 20
9 27
10 16
11 6
12 33
13 52
14 79
15 32
16 7
17 48
18 89
19 240
20 255
21 64
22 8
23 67
24 140
25 581
26 984
27 843
28 128
29 9
30 88
31 207
32 1132
33 2909
34 4412
35 2763
36 256
37 10
38 113
39 288
40 1991
41 6732
42 17885
43 20252
44 8903
45 512
46 11
47 140
48 389
49 3156
50 14003
51 51884
52 107387
53 91808
54 28215
55 1024
56 12

List of values

[2, 3, 4, 4, 11, 8, 5, 20, 27, 16, 6, 33, 52, 79, 32, 7, 48, 89, 240, 255, 64, 8, 67, 140, 581, 984, 843, 128, 9, 88, 207, 1132, 2909, 4412, 2763, 256, 10, 113, 288, 1991, 6732, 17885, 20252, 8903, 512, 11, 140, 389, 3156, 14003, 51884, 107387, 91808, 28215, 1024, 12]