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.

A243830 Number A(n,k) of Dyck paths of semilength n having exactly four (possibly overlapping) occurrences of the consecutive step pattern given by the binary expansion of k, where 1=U=(1,1) and 0=D=(1,-1); square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
10 0
11 0
12 0
13 0
14 14
15 0
16 0
17 0
18 0
19 14
20 0
21 0
22 0
23 0
24 0
25 1
26 0
27 0
28 0
29 0
30 0
31 0
32 0
33 10
34 0
35 0
36 0
37 0
38 0
39 0
40 0
41 1
42 50
43 0
44 0
45 0
46 0
47 0
48 0
49 0
50 0
51 15
52 175
53 0
54 0
55 0
56 0
57 0
58 0
59 0
60 1
61 0
62 105
63 490
64 0
65 0
66 0
67 0
68 0
69 0
70 0
71 0
72 5
73 0
74 490
75 1176
76 0
77 0
78 0
79 0
80 0
81 0
82 0
83 0
84 0
85 30
86 14
87 1764
88 2520
89 0
90 0
91 0
92 0
93 0
94 0
95 0
96 0
97 1
98 0
99 140
100 210
101 5292
102 4950
103 0
104 0

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 0, 0, 0, 0, 14, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 0, 1, 50, 0, 0, 0, 0, 0, 0, 0, 0, 15, 175, 0, 0, 0, 0, 0, 0, 0, 1, 0, 105, 490, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 490, 1176, 0, 0, 0, 0, 0, 0, 0, 0, 0, 30, 14, 1764, 2520, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 140, 210, 5292, 4950, 0, 0]