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.

A369326 Array read by ascending antidiagonals: A(n,k) is the number of words of length n over the alphabet [k] and sortable by a (2,1)-pop stack of depth 2.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 1
6 0
7 1
8 2
9 1
10 0
11 1
12 4
13 3
14 1
15 0
16 1
17 8
18 9
19 4
20 1
21 0
22 1
23 16
24 24
25 16
26 5
27 1
28 0
29 1
30 32
31 59
32 52
33 25
34 6
35 1
36 0
37 1
38 64
39 138
40 149
41 95
42 36
43 7
44 1
45 0
46 1
47 128
48 313
49 396
50 310
51 156
52 49
53 8
54 1
55 0
56 1
57 256
58 696
59 1003
60 923
61 571
62 238
63 64
64 9
65 1
66 0
67 1
68 512
69 1527
70 2458
71 2585
72 1884
73 966
74 344
75 81
76 10
77 1

List of values

[1, 0, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 4, 3, 1, 0, 1, 8, 9, 4, 1, 0, 1, 16, 24, 16, 5, 1, 0, 1, 32, 59, 52, 25, 6, 1, 0, 1, 64, 138, 149, 95, 36, 7, 1, 0, 1, 128, 313, 396, 310, 156, 49, 8, 1, 0, 1, 256, 696, 1003, 923, 571, 238, 64, 9, 1, 0, 1, 512, 1527, 2458, 2585, 1884, 966, 344, 81, 10, 1]