A229293 - cp's OEIS frontend

A229293 Number of binary words of length n with exactly k (possibly overlapping) occurrences of the subword given by the binary expansion of n for maximal k with at least one word.

n	a(n)
0	1
1	1
2	1
3	1
4	4
5	1
6	1
7	1
8	1
9	18
10	1
11	6
12	1
13	1
14	40
15	1
16	8
17	1
18	4
19	33
20	1
21	1
22	17
23	42
24	1120
25	1
26	12
27	11
28	448
29	1
30	1
31	1
32	84
33	52
34	1
35	985
36	1
37	10
38	1
39	316
40	3360
41	1
42	1
43	75
44	144
45	1
46	1
47	12
48	1
49	504
50	180
51	15
52	7920
53	102
54	1
55	16
56	220
57	14
58	11440
59	17
60	1
61	1
62	264
63	1
64	20
65	3206
66	399
67	1
68	4

[1, 1, 1, 1, 4, 1, 1, 1, 1, 18, 1, 6, 1, 1, 40, 1, 8, 1, 4, 33, 1, 1, 17, 42, 1120, 1, 12, 11, 448, 1, 1, 1, 84, 52, 1, 985, 1, 10, 1, 316, 3360, 1, 1, 75, 144, 1, 1, 12, 1, 504, 180, 15, 7920, 102, 1, 16, 220, 14, 11440, 17, 1, 1, 264, 1, 20, 3206, 399, 1, 4]

cp's OEIS Frontend

A229293 Number of binary words of length n with exactly k (possibly overlapping) occurrences of the subword given by the binary expansion of n for maximal k with at least one word.

Table of values

List of values