

A264695


Number of equidistributed binary strings of length n.


0



2, 2, 6, 4, 4, 12, 34, 20, 16, 8, 68, 100, 144, 314, 668, 360, 288, 128, 192, 400
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

A string w is equidistributed if the number of occurrences of any two factors (contiguous subwords) in w differ by at most 1. Here are examples of equidistributed words for the first few lengths: 0, 01, 010, 0110, 00110, 001101, 0011010, 01001110,011100010, 0101110001, 01011100010, 010111000110.


LINKS

Table of n, a(n) for n=1..20.
A. Carpi and A. de Luca, Uniform words, Advances in Applied Mathematics, 32 (2004), 485522.
Teturo Kamae and YuMei Xue, An Easy Criterion for Randomness, Sankhya: The Indian Journal of Statistics, 2015, Volume 77A, Part 1, pp. 126152, DOI:10.1007/s1317101400543.


CROSSREFS

Sequence in context: A182786 A009279 A059943 * A112336 A028390 A036500
Adjacent sequences: A264692 A264693 A264694 * A264696 A264697 A264698


KEYWORD

nonn,more


AUTHOR

Jeffrey Shallit, Nov 21 2015


EXTENSIONS

a(15) from Jeffrey Shallit, Nov 26 2015
a(16)a(20) from Jeffrey Shallit, Feb 25 2018


STATUS

approved



