

A135017


a(n) = number of strings of length n that can be obtained by starting with abc and repeatedly doubling any substring in place and then discarding any string that contains two successive equal letters.


4



0, 0, 1, 0, 2, 1, 3, 5, 7, 15, 20, 48, 60, 156, 205, 489, 761, 1572, 2796, 5357, 10174, 19021, 37272, 69375, 137759, 258444, 513696, 976890, 1934900, 3727164, 7358675, 14316861, 28217028, 55288907, 108942267, 214462953, 422973649
(list;
graph;
refs;
listen;
history;
text;
internal format)




