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.

A209349 Number A(n,k) of initially rising meander words, where each letter of the cyclic k-ary alphabet occurs n times; 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 1
6 1
7 1
8 0
9 1
10 1
11 1
12 1
13 0
14 1
15 1
16 1
17 5
18 1
19 0
20 1
21 1
22 1
23 9
24 29
25 1
26 0
27 1
28 1
29 1
30 11
31 100
32 182
33 1
34 0
35 1
36 1
37 1
38 16
39 182
40 1225
41 1198
42 1
43 0
44 1
45 1
46 1
47 19
48 484
49 3542
50 15876
51 8142
52 1
53 0
54 1
55 1
56 1
57 25
58 902
59 17956
60 76258
61 213444
62 56620
63 1
64 0
65 1

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 5, 1, 0, 1, 1, 1, 9, 29, 1, 0, 1, 1, 1, 11, 100, 182, 1, 0, 1, 1, 1, 16, 182, 1225, 1198, 1, 0, 1, 1, 1, 19, 484, 3542, 15876, 8142, 1, 0, 1, 1, 1, 25, 902, 17956, 76258, 213444, 56620, 1, 0, 1]