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.

A297526 Number of binary words w of length n such that the number of distinct blocks of length k that w contains is <= k+2 for all k.

Table of values

n a(n)
0 1
1 2
2 4
3 8
4 16
5 32
6 64
7 128
8 208
9 338
10 482
11 684
12 918
13 1218
14 1526
15 1958
16 2392
17 2918
18 3490
19 4182
20 4888
21 5752
22 6598
23 7626
24 8700
25 9906
26 11110
27 12592
28 14066
29 15700
30 17386
31 19286
32 21188
33 23390
34 25522
35 27994
36 30492
37 33186
38 35900
39 39024
40 42110
41 45428
42 48802
43 52530
44 56240
45 60368
46 64366
47 68842
48 73390
49 78188
50 82966

List of values

[1, 2, 4, 8, 16, 32, 64, 128, 208, 338, 482, 684, 918, 1218, 1526, 1958, 2392, 2918, 3490, 4182, 4888, 5752, 6598, 7626, 8700, 9906, 11110, 12592, 14066, 15700, 17386, 19286, 21188, 23390, 25522, 27994, 30492, 33186, 35900, 39024, 42110, 45428, 48802, 52530, 56240, 60368, 64366, 68842, 73390, 78188, 82966]

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

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