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.

A233940 Number T(n,k) of binary words of length n with exactly k (possibly overlapping) occurrences of the subword given by the binary expansion of n; triangle T(n,k), n>=0, read by rows.

Table of values

n a(n)
0 1
1 1
2 1
3 3
4 1
5 5
6 2
7 1
8 12
9 4
10 21
11 10
12 1
13 33
14 30
15 1
16 81
17 26
18 13
19 5
20 2
21 1
22 177
23 78
24 1
25 338
26 156
27 18
28 667
29 278
30 68
31 10
32 1
33 1178
34 722
35 142
36 6
37 2031
38 1827
39 237
40 1
41 4105
42 3140
43 862
44 84
45 1
46 6872
47 7800
48 1672
49 40
50 20569
51 5810
52 3188
53 1662
54 829
55 394
56 181
57 80
58 35
59 12
60 5
61 2
62 1

List of values

[1, 1, 1, 3, 1, 5, 2, 1, 12, 4, 21, 10, 1, 33, 30, 1, 81, 26, 13, 5, 2, 1, 177, 78, 1, 338, 156, 18, 667, 278, 68, 10, 1, 1178, 722, 142, 6, 2031, 1827, 237, 1, 4105, 3140, 862, 84, 1, 6872, 7800, 1672, 40, 20569, 5810, 3188, 1662, 829, 394, 181, 80, 35, 12, 5, 2, 1]