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.

A215190 T(n,k)=Number of arrays of n 0..k integers with no sum of consecutive elements equal to a disjoint adjacent sum of an equal number of elements.

Table of values

n a(n)
1 2
2 3
3 2
4 4
5 6
6 2
7 5
8 12
9 12
10 0
11 6
12 20
13 36
14 18
15 0
16 7
17 30
18 80
19 88
20 30
21 0
22 8
23 42
24 150
25 276
26 216
27 30
28 0
29 9
30 56
31 252
32 664
33 954
34 440
35 18
36 0
37 10
38 72
39 392
40 1366
41 2940
42 2898
43 896
44 0
45 0
46 11
47 90
48 576
49 2512
50 7404
51 11756
52 8808
53 1626
54 0
55 0
56 12
57 110
58 810
59 4264
60 16092
61 36864
62 46972
63 24014

List of values

[2, 3, 2, 4, 6, 2, 5, 12, 12, 0, 6, 20, 36, 18, 0, 7, 30, 80, 88, 30, 0, 8, 42, 150, 276, 216, 30, 0, 9, 56, 252, 664, 954, 440, 18, 0, 10, 72, 392, 1366, 2940, 2898, 896, 0, 0, 11, 90, 576, 2512, 7404, 11756, 8808, 1626, 0, 0, 12, 110, 810, 4264, 16092, 36864, 46972, 24014]