A215075 - cp's OEIS frontend

A215075 T(n,k) = Number of squarefree words of length n in a (k+1)-ary alphabet, with new values 0..k introduced in increasing order.

n	a(n)
1	1
2	1
3	1
4	1
5	1
6	1
7	1
8	1
9	2
10	0
11	1
12	1
13	2
14	3
15	0
16	1
17	1
18	2
19	4
20	5
21	0
22	1
23	1
24	2
25	4
26	11
27	7
28	0
29	1
30	1
31	2
32	4
33	12
34	29
35	10
36	0
37	1
38	1
39	2
40	4
41	12
42	39
43	77
44	13
45	0
46	1
47	1
48	2
49	4
50	12
51	40
52	138
53	202
54	18
55	0
56	1
57	1
58	2
59	4
60	12
61	40
62	153
63	503
64	532
65	24
66	0
67	1
68	1
69	2
70	4
71	12
72	40
73	154
74	638
75	1864
76	1395
77	34
78	0
79	1
80	1
81	2
82	4
83	12
84	40
85	154
86	659

[1, 1, 1, 1, 1, 1, 1, 1, 2, 0, 1, 1, 2, 3, 0, 1, 1, 2, 4, 5, 0, 1, 1, 2, 4, 11, 7, 0, 1, 1, 2, 4, 12, 29, 10, 0, 1, 1, 2, 4, 12, 39, 77, 13, 0, 1, 1, 2, 4, 12, 40, 138, 202, 18, 0, 1, 1, 2, 4, 12, 40, 153, 503, 532, 24, 0, 1, 1, 2, 4, 12, 40, 154, 638, 1864, 1395, 34, 0, 1, 1, 2, 4, 12, 40, 154, 659]

cp's OEIS Frontend

A215075 T(n,k) = Number of squarefree words of length n in a (k+1)-ary alphabet, with new values 0..k introduced in increasing order.

Table of values

List of values