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.

A200181 T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with zero sum and no two consecutive declines, no adjacent equal elements, and no element more than one greater than the previous (random base sawtooth pattern).

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 3
7 1
8 3
9 3
10 3
11 1
12 4
13 5
14 6
15 2
16 1
17 5
18 5
19 11
20 12
21 6
22 1
23 6
24 7
25 14
26 15
27 15
28 10
29 1
30 7
31 7
32 19
33 24
34 29
35 29
36 7
37 1
38 8
39 9
40 26
41 31
42 48
43 78
44 72
45 12
46 1
47 9
48 9
49 31
50 48
51 72
52 100
53 160
54 133
55 28
56 1
57 10
58 11
59 38
60 53
61 103
62 186
63 280
64 283
65 214
66 29
67 1
68 11
69 11
70 47
71 74
72 141
73 246
74 460
75 608
76 574
77 394

List of values

[1, 1, 1, 1, 2, 3, 1, 3, 3, 3, 1, 4, 5, 6, 2, 1, 5, 5, 11, 12, 6, 1, 6, 7, 14, 15, 15, 10, 1, 7, 7, 19, 24, 29, 29, 7, 1, 8, 9, 26, 31, 48, 78, 72, 12, 1, 9, 9, 31, 48, 72, 100, 160, 133, 28, 1, 10, 11, 38, 53, 103, 186, 280, 283, 214, 29, 1, 11, 11, 47, 74, 141, 246, 460, 608, 574, 394]