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.

A342239 Table read by upward antidiagonals: T(n,k) is the number of strings of length k over an n-letter alphabet that are bifix free; n >= 1, k >= 1.

Table of values

n a(n)
1 1
2 2
3 0
4 3
5 2
6 0
7 4
8 6
9 4
10 0
11 5
12 12
13 18
14 6
15 0
16 6
17 20
18 48
19 48
20 12
21 0
22 7
23 30
24 100
25 180
26 144
27 20
28 0
29 8
30 42
31 180
32 480
33 720
34 414
35 40
36 0
37 9
38 56
39 294
40 1050
41 2400
42 2832
43 1242
44 74
45 0
46 10
47 72
48 448
49 2016
50 6300
51 11900
52 11328
53 3678
54 148
55 0
56 11
57 90
58 648
59 3528
60 14112
61 37620
62 59500
63 45132
64 11034
65 284
66 0

List of values

[1, 2, 0, 3, 2, 0, 4, 6, 4, 0, 5, 12, 18, 6, 0, 6, 20, 48, 48, 12, 0, 7, 30, 100, 180, 144, 20, 0, 8, 42, 180, 480, 720, 414, 40, 0, 9, 56, 294, 1050, 2400, 2832, 1242, 74, 0, 10, 72, 448, 2016, 6300, 11900, 11328, 3678, 148, 0, 11, 90, 648, 3528, 14112, 37620, 59500, 45132, 11034, 284, 0]