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.

A236232 Number of binary words of length n with exactly 3 (possibly overlapping) occurrences of the subword given by the binary expansion of n.

Table of values

n a(n)
7 5
8 0
9 0
10 10
11 6
12 1
13 84
14 40
15 1662
16 8
17 276
18 1948
19 2220
20 1788
21 52903
22 63836
23 92548
24 108160
25 527238
26 691832
27 4591942
28 4085120
29 14751215
30 22719212
31 116689525
32 10635080
33 42281072
34 136612465
35 216703500
36 987830670
37 1083905462
38 3170868937
39 5311691060
40 8407495040

List of values

[5, 0, 0, 10, 6, 1, 84, 40, 1662, 8, 276, 1948, 2220, 1788, 52903, 63836, 92548, 108160, 527238, 691832, 4591942, 4085120, 14751215, 22719212, 116689525, 10635080, 42281072, 136612465, 216703500, 987830670, 1083905462, 3170868937, 5311691060, 8407495040]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.