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.

A357824 Total number A(n,k) of k-tuples of semi-Dyck paths from (0,0) to (n,n-2*j) for j=0..floor(n/2); square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 2
6 1
7 1
8 2
9 2
10 1
11 1
12 2
13 3
14 3
15 1
16 1
17 2
18 5
19 6
20 3
21 1
22 1
23 2
24 9
25 14
26 10
27 4
28 1
29 1
30 2
31 17
32 36
33 42
34 20
35 4
36 1
37 1
38 2
39 33
40 98
41 190
42 132
43 35
44 5
45 1
46 1
47 2
48 65
49 276
50 882
51 980
52 429
53 70
54 5
55 1
56 1
57 2
58 129
59 794
60 4150
61 7812
62 5705
63 1430
64 126
65 6
66 1
67 1
68 2
69 257
70 2316
71 19722
72 65300
73 78129
74 33040
75 4862
76 252
77 6

List of values

[1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 2, 3, 3, 1, 1, 2, 5, 6, 3, 1, 1, 2, 9, 14, 10, 4, 1, 1, 2, 17, 36, 42, 20, 4, 1, 1, 2, 33, 98, 190, 132, 35, 5, 1, 1, 2, 65, 276, 882, 980, 429, 70, 5, 1, 1, 2, 129, 794, 4150, 7812, 5705, 1430, 126, 6, 1, 1, 2, 257, 2316, 19722, 65300, 78129, 33040, 4862, 252, 6]