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.

A294220 Number A(n,k) of ascent sequences of length n where no letter multiplicity is larger than k; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

n a(n)
0 1
1 1
2 0
3 1
4 1
5 0
6 1
7 1
8 1
9 0
10 1
11 1
12 2
13 1
14 0
15 1
16 1
17 2
18 4
19 1
20 0
21 1
22 1
23 2
24 5
25 10
26 1
27 0
28 1
29 1
30 2
31 5
32 14
33 27
34 1
35 0
36 1
37 1
38 2
39 5
40 15
41 47
42 83
43 1
44 0
45 1
46 1
47 2
48 5
49 15
50 52
51 180
52 277
53 1
54 0
55 1
56 1
57 2
58 5
59 15
60 53
61 210
62 773
63 1015
64 1
65 0
66 1
67 1
68 2
69 5
70 15
71 53
72 216
73 964
74 3701
75 4007
76 1
77 0

List of values

[1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 2, 1, 0, 1, 1, 2, 4, 1, 0, 1, 1, 2, 5, 10, 1, 0, 1, 1, 2, 5, 14, 27, 1, 0, 1, 1, 2, 5, 15, 47, 83, 1, 0, 1, 1, 2, 5, 15, 52, 180, 277, 1, 0, 1, 1, 2, 5, 15, 53, 210, 773, 1015, 1, 0, 1, 1, 2, 5, 15, 53, 216, 964, 3701, 4007, 1, 0]