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.

A250646 T(n,k)=Number of length n+1 0..k arrays with the sum of the maximum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.

Table of values

n a(n)
1 1
2 1
3 6
4 1
5 17
6 6
7 1
8 36
9 23
10 20
11 1
12 65
13 44
14 125
15 28
16 1
17 106
18 89
19 476
20 280
21 72
22 1
23 161
24 134
25 1293
26 1424
27 1061
28 120
29 1
30 232
31 219
32 2954
33 4853
34 7696
35 2870
36 272
37 1
38 321
39 296
40 5901
41 12473
42 34441
43 28238
44 9495
45 496
46 1
47 430
48 433
49 10766
50 28379
51 120114
52 163043
53 126482

List of values

[1, 1, 6, 1, 17, 6, 1, 36, 23, 20, 1, 65, 44, 125, 28, 1, 106, 89, 476, 280, 72, 1, 161, 134, 1293, 1424, 1061, 120, 1, 232, 219, 2954, 4853, 7696, 2870, 272, 1, 321, 296, 5901, 12473, 34441, 28238, 9495, 496, 1, 430, 433, 10766, 28379, 120114, 163043, 126482]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.