cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A094005 a(n) = sum of lengths of strings that can be generated by any starting string of n 2's and 3's, using the rule described in the Comments lines.

Original entry on oeis.org

2, 11, 30, 82, 199, 480, 1097, 2630, 5828, 12830, 27873, 60071, 128355, 273543, 580149, 1226626, 2584822, 5433676, 11392986, 23838396, 49776503, 103755527, 215904926, 448602871, 930771041, 1928682932, 3991605129, 8251710234, 17040335019, 35154540729, 72456654860, 149208536983
Offset: 1

Views

Author

N. J. A. Sloane, May 31 2004

Keywords

Comments

Start with any initial string of n numbers s(1), ..., s(n), all = 2 or 3 (so there are 2^n starting strings). The rule for extending the string is this:
To get s(i+1), write the string s(1)s(2)...s(i) as xy^k for words x and y (where y has positive length) and k is maximized, i.e., k = the maximal number of repeating blocks at the end of the sequence so far (k is the curling number of s(1)s(2)...s(i)). Then s(i+1) = k if k >=2, but if k=1 you must stop (without writing down the 1).
a(n) = sum of final length of string, summed over all 2^n starting strings.
See A094004 for more terms. - N. J. A. Sloane, Dec 25 2012

Crossrefs

Formula

Equals A216813(n) + n*2^n. - N. J. A. Sloane, Sep 26 2012
A093369 is closely related.

Extensions

a(27)-a(31) from N. J. A. Sloane, Sep 19 2012