

A214613


Abelian complexity function of ordinary paperfolding word (A014707).


3



2, 3, 4, 3, 4, 5, 4, 3, 4, 5, 6, 5, 4, 5, 4, 3, 4, 5, 6, 5, 6, 7, 6, 5, 6, 5, 6, 5, 6, 5, 4, 3, 4, 5, 6, 5, 6, 7, 6, 5, 6, 7, 8, 7, 6, 7, 6, 5, 6, 7, 6, 5, 6, 7, 6, 5, 6, 7, 6, 5, 6, 5, 4, 3, 4, 5, 6, 5, 6, 7, 6, 5, 6, 7, 8, 7, 6, 7, 6, 5, 6, 7
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS



LINKS



FORMULA

Madill and Rampersad provide the following recurrence:
a(1) = 2,
a(4n) = a(2n),
a(4n+2) = a(2n+1) + 1,
a(16n+1) = a(8n+1),
a(16n+{3,7,9,13}) = a(2n+1) + 2,
a(16n+5) = a(4n+1) + 2,
a(16n+11) = a(4n+3) + 2,
a(16n+15) = a(2n+2) + 1. (End)


CROSSREFS



KEYWORD

nonn


AUTHOR



EXTENSIONS



STATUS

approved



