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.

A214943 T(n,k) = Number of squarefree words of length n in a (k+1)-ary alphabet.

Table of values

n a(n)
1 2
2 3
3 2
4 4
5 6
6 2
7 5
8 12
9 12
10 0
11 6
12 20
13 36
14 18
15 0
16 7
17 30
18 80
19 96
20 30
21 0
22 8
23 42
24 150
25 300
26 264
27 42
28 0
29 9
30 56
31 252
32 720
33 1140
34 696
35 60
36 0
37 10
38 72
39 392
40 1470
41 3480
42 4260
43 1848
44 78
45 0
46 11
47 90
48 576
49 2688
50 8610
51 16680
52 15960
53 4848
54 108
55 0
56 12
57 110
58 810
59 4536
60 18480
61 50190
62 80040

List of values

[2, 3, 2, 4, 6, 2, 5, 12, 12, 0, 6, 20, 36, 18, 0, 7, 30, 80, 96, 30, 0, 8, 42, 150, 300, 264, 42, 0, 9, 56, 252, 720, 1140, 696, 60, 0, 10, 72, 392, 1470, 3480, 4260, 1848, 78, 0, 11, 90, 576, 2688, 8610, 16680, 15960, 4848, 108, 0, 12, 110, 810, 4536, 18480, 50190, 80040]