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.

A260668 Number of binary words of length n such that for every prefix the number of occurrences of subword 101 is larger than or equal to the number of occurrences of subword 010.

Table of values

n a(n)
0 1
1 2
2 4
3 7
4 13
5 24
6 45
7 84
8 158
9 298
10 566
11 1079
12 2066
13 3966
14 7635
15 14730
16 28484
17 55188
18 107130
19 208294
20 405594
21 790812
22 1543766
23 3016923
24 5901858
25 11556244
26 22647431
27 44418613
28 87182680
29 171234318
30 336532357
31 661788956
32 1302124526
33 2563365624
34 5048704640

List of values

[1, 2, 4, 7, 13, 24, 45, 84, 158, 298, 566, 1079, 2066, 3966, 7635, 14730, 28484, 55188, 107130, 208294, 405594, 790812, 1543766, 3016923, 5901858, 11556244, 22647431, 44418613, 87182680, 171234318, 336532357, 661788956, 1302124526, 2563365624, 5048704640]

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

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