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.

A342238 Table read by upward antidiagonals: T(n,k) is the number of strings of length k over an n-letter alphabet that do not begin with a palindrome of two or more letters; n, 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 2
10 0
11 5
12 12
13 12
14 2
15 0
16 6
17 20
18 36
19 30
20 2
21 0
22 7
23 30
24 80
25 132
26 78
27 2
28 0
29 8
30 42
31 150
32 380
33 492
34 222
35 2
36 0
37 9
38 56
39 252
40 870
41 1820
42 1932
43 636
44 2
45 0
46 10
47 72
48 392
49 1722
50 5070
51 9020
52 7596
53 1878
54 2
55 0
56 11
57 90
58 576
59 3080
60 11802
61 30270
62 44720
63 30252
64 5556
65 2
66 0

List of values

[1, 2, 0, 3, 2, 0, 4, 6, 2, 0, 5, 12, 12, 2, 0, 6, 20, 36, 30, 2, 0, 7, 30, 80, 132, 78, 2, 0, 8, 42, 150, 380, 492, 222, 2, 0, 9, 56, 252, 870, 1820, 1932, 636, 2, 0, 10, 72, 392, 1722, 5070, 9020, 7596, 1878, 2, 0, 11, 90, 576, 3080, 11802, 30270, 44720, 30252, 5556, 2, 0]