

A005943


Factor complexity (number of subwords of length n) of the GolayRudinShapiro binary word A020987.
(Formerly M1116)


3



1, 2, 4, 8, 16, 24, 36, 46, 56, 64, 72, 80, 88, 96, 104, 112, 120, 128, 136, 144, 152, 160, 168, 176, 184, 192, 200, 208, 216, 224, 232, 240, 248, 256, 264, 272, 280
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,2


COMMENTS

Terms a(0)..a(13) were verified and terms a(14)..a(32) were computed using the first 2^32 terms of the GRS sequence. [Joerg Arndt, Jun 10 2012]
Terms a(0)..a(63) were computed using the first 2^36 terms of the GRS sequence, and are consistent with Arndt's conjectured g.f.  Sean A. Irvine, Oct 12 2016
Needs a bfile.  N. J. A. Sloane, Jun 04 2019


REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).


LINKS

Table of n, a(n) for n=0..36.
J.P. Allouche and J. Shallit, The ring of kregular sequences, Theoretical Computer Sci., 98 (1992), 163197.


FORMULA

Conjectured g.f. (1+x^2+2*x^3+4*x^4+4*x^62*x^72*x^9)/(1x)^2. [Joerg Arndt, Jun 10 2012]


EXAMPLE

All 8 subwords of length three (000, 001, ..., 111) occur in A020987, so a(3) = 8.


MAPLE

# Naive Maple program, useful for getting initial terms of factor complexity FC of a sequence b1[]. N. J. A. Sloane, Jun 04 2019
FC:=[0]; # a(0)=0 from the empty subword
for L from 1 to 12 do
lis := {};
for n from 1 to nops(b1)L do
s:=[seq(b1[i], i=n..n+L1)];
lis:={op(lis), s}; od:
FC:=[op(FC), nops(lis)];
od:
FC;


CROSSREFS

Cf. A006697, A005942.
Sequence in context: A010072 A318654 A305656 * A330131 A008233 A224815
Adjacent sequences: A005940 A005941 A005942 * A005944 A005945 A005946


KEYWORD

nonn,nice,more


AUTHOR

N. J. A. Sloane, Jeffrey Shallit.


EXTENSIONS

Minor edits by N. J. A. Sloane, Jun 06 2012
Added a(14)a(32), Joerg Arndt, Jun 10 2012.
Added a(33)a(36), Joerg Arndt, Oct 28 2012.


STATUS

approved



