

A362063


Number of 2balanced binary words of length n with respect to the permutations of the symbols.


1



1, 1, 2, 4, 8, 16, 31, 60, 111, 205, 364, 647, 1110, 1908, 3190, 5345, 8743, 14352, 23090, 37232, 59113, 94079, 147531, 232073, 360750, 561692, 865823, 1338269, 2047388, 3139690, 4781349, 7281656, 11021651, 16716751, 25178531, 37994309, 57046272
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,3


COMMENTS

2balanced binary words are here defined as the binary words with such property that the sum of each subblock differs by at most 2 from every other subblock of the same length.
Can be interpreted as a number of 2balanced binary words with the prefix "0".


LINKS



FORMULA

a(n) = A274005(n)/2 for n>0, since A274005 is the number of all binary 2balanced words of given length.


EXAMPLE

a(3) = 4 since 000, 001, 010 and 011 are 2balanced.
a(6) = 31 since all words of form 0XXXXX are 2balanced, except the word 000111.


CROSSREFS

A274005 is the number of all binary 2balanced words with given length.
A005598 is the number of all binary balanced (1balanced) words with given length.


KEYWORD

nonn


AUTHOR



STATUS

approved



