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.

A265624 Array T(n,k): The number of words of length n in an alphabet of size k which do not contain 4 consecutive letters.

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 4
6 3
7 0
8 8
9 9
10 4
11 0
12 14
13 27
14 16
15 5
16 0
17 26
18 78
19 64
20 25
21 6
22 0
23 48
24 228
25 252
26 125
27 36
28 7
29 0
30 88
31 666
32 996
33 620
34 216
35 49
36 8
37 0
38 162
39 1944
40 3936
41 3080
42 1290
43 343
44 64
45 9
46 0
47 298
48 5676
49 15552
50 15300
51 7710
52 2394
53 512
54 81
55 10
56 0
57 548
58 16572
59 61452

List of values

[1, 1, 2, 1, 4, 3, 0, 8, 9, 4, 0, 14, 27, 16, 5, 0, 26, 78, 64, 25, 6, 0, 48, 228, 252, 125, 36, 7, 0, 88, 666, 996, 620, 216, 49, 8, 0, 162, 1944, 3936, 3080, 1290, 343, 64, 9, 0, 298, 5676, 15552, 15300, 7710, 2394, 512, 81, 10, 0, 548, 16572, 61452]