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.

A188181 T(n,k) is the number of strictly increasing arrangements of n numbers in -(n+k-2)..(n+k-2) with sum zero.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 2
7 1
8 3
9 5
10 5
11 1
12 4
13 8
14 12
15 12
16 1
17 5
18 13
19 24
20 32
21 32
22 1
23 6
24 18
25 43
26 73
27 94
28 94
29 1
30 7
31 25
32 69
33 141
34 227
35 289
36 289
37 1
38 8
39 32
40 104
41 252
42 480
43 734
44 910
45 910
46 1
47 9
48 41
49 150
50 414
51 920
52 1656
53 2430
54 2934
55 2934
56 1
57 10
58 50
59 207
60 649
61 1636
62 3370
63 5744
64 8150
65 9686
66 9686
67 1
68 11

List of values

[1, 1, 1, 1, 2, 2, 1, 3, 5, 5, 1, 4, 8, 12, 12, 1, 5, 13, 24, 32, 32, 1, 6, 18, 43, 73, 94, 94, 1, 7, 25, 69, 141, 227, 289, 289, 1, 8, 32, 104, 252, 480, 734, 910, 910, 1, 9, 41, 150, 414, 920, 1656, 2430, 2934, 2934, 1, 10, 50, 207, 649, 1636, 3370, 5744, 8150, 9686, 9686, 1, 11]