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.

A212868 Rectangular array T(n,k) = number of nondecreasing sequences of n 1..k integers with no element dividing the sequence sum (for n, k >= 1), read by decreasing antidiagonals.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 1
9 0
10 0
11 0
12 2
13 1
14 0
15 0
16 0
17 5
18 3
19 1
20 0
21 0
22 0
23 7
24 9
25 5
26 2
27 0
28 0
29 0
30 12
31 16
32 15
33 6
34 2
35 0
36 0
37 0
38 16
39 29
40 29
41 22
42 9
43 2
44 0
45 0
46 0
47 22
48 43
49 59
50 52
51 32
52 12
53 3
54 0
55 0
56 0
57 28
58 64
59 103
60 112
61 82
62 40
63 15
64 3
65 0
66 0
67 0
68 37
69 92
70 168
71 212
72 199
73 122
74 59
75 17
76 3
77 0
78 0
79 0
80 43
81 127
82 259
83 376
84 407

List of values

[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 2, 1, 0, 0, 0, 5, 3, 1, 0, 0, 0, 7, 9, 5, 2, 0, 0, 0, 12, 16, 15, 6, 2, 0, 0, 0, 16, 29, 29, 22, 9, 2, 0, 0, 0, 22, 43, 59, 52, 32, 12, 3, 0, 0, 0, 28, 64, 103, 112, 82, 40, 15, 3, 0, 0, 0, 37, 92, 168, 212, 199, 122, 59, 17, 3, 0, 0, 0, 43, 127, 259, 376, 407]