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.

A208673 Number of words A(n,k), either empty or beginning with the first letter of the k-ary alphabet, where each letter of the alphabet occurs n times and letters of neighboring word positions are equal or neighbors in the alphabet; 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 1
9 1
10 1
11 1
12 3
13 1
14 1
15 1
16 1
17 5
18 10
19 1
20 1
21 1
22 1
23 9
24 37
25 35
26 1
27 1
28 1
29 1
30 15
31 163
32 309
33 126
34 1
35 1
36 1
37 1
38 25
39 640
40 3593
41 2751
42 462
43 1
44 1
45 1
46 1
47 41
48 2503
49 36095
50 87501
51 25493
52 1716
53 1
54 1
55 1
56 1
57 67
58 9559
59 362617
60 2336376
61 2266155
62 242845
63 6435
64 1
65 1

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 5, 10, 1, 1, 1, 1, 9, 37, 35, 1, 1, 1, 1, 15, 163, 309, 126, 1, 1, 1, 1, 25, 640, 3593, 2751, 462, 1, 1, 1, 1, 41, 2503, 36095, 87501, 25493, 1716, 1, 1, 1, 1, 67, 9559, 362617, 2336376, 2266155, 242845, 6435, 1, 1]