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.

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

Table of values

n a(n)
1 3
2 5
3 6
4 7
5 17
6 10
7 9
8 36
9 38
10 20
11 11
12 65
13 99
14 125
15 36
16 13
17 106
18 205
19 476
20 335
21 72
22 15
23 161
24 370
25 1351
26 1693
27 1061
28 136
29 17
30 232
31 606
32 3154
33 5982
34 7504
35 3069
36 272
37 19
38 321
39 927
40 6433
41 16790
42 34415
43 29221
44 9495
45 528
46 21
47 430
48 1345
49 11906
50 39916
51 119364
52 169352

List of values

[3, 5, 6, 7, 17, 10, 9, 36, 38, 20, 11, 65, 99, 125, 36, 13, 106, 205, 476, 335, 72, 15, 161, 370, 1351, 1693, 1061, 136, 17, 232, 606, 3154, 5982, 7504, 3069, 272, 19, 321, 927, 6433, 16790, 34415, 29221, 9495, 528, 21, 430, 1345, 11906, 39916, 119364, 169352]

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

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