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.

A250229 T(n,k)=Number of length n+1 0..k arrays with the sum of the cubes 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 208
20 223
21 64
22 8
23 67
24 132
25 473
26 704
27 651
28 128
29 9
30 88
31 187
32 872
33 1785
34 2720
35 1907
36 256
37 10
38 113
39 248
40 1519
41 3496
42 9437
43 10952
44 5639
45 512
46 11
47 140
48 321
49 2392
50 6367
51 24888
52 47953
53 45888
54 16967
55 1024
56 12
57 171

List of values

[2, 3, 4, 4, 11, 8, 5, 20, 27, 16, 6, 33, 52, 79, 32, 7, 48, 89, 208, 223, 64, 8, 67, 132, 473, 704, 651, 128, 9, 88, 187, 872, 1785, 2720, 1907, 256, 10, 113, 248, 1519, 3496, 9437, 10952, 5639, 512, 11, 140, 321, 2392, 6367, 24888, 47953, 45888, 16967, 1024, 12, 171]