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.

A211561 T(n,k) = number of nonnegative integer arrays of length n+k-1 with new values 0 upwards introduced in order, and containing the value k-1.

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 4
6 5
7 1
8 7
9 14
10 15
11 1
12 11
13 36
14 51
15 52
16 1
17 16
18 81
19 171
20 202
21 203
22 1
23 22
24 162
25 512
26 813
27 876
28 877
29 1
30 29
31 295
32 1345
33 3046
34 4012
35 4139
36 4140
37 1
38 37
39 499
40 3145
41 10096
42 17866
43 20891
44 21146
45 21147
46 1
47 46
48 796
49 6676
50 29503
51 72028
52 106133
53 115463
54 115974
55 115975

List of values

[1, 1, 2, 1, 4, 5, 1, 7, 14, 15, 1, 11, 36, 51, 52, 1, 16, 81, 171, 202, 203, 1, 22, 162, 512, 813, 876, 877, 1, 29, 295, 1345, 3046, 4012, 4139, 4140, 1, 37, 499, 3145, 10096, 17866, 20891, 21146, 21147, 1, 46, 796, 6676, 29503, 72028, 106133, 115463, 115974, 115975]