95607

Appears in sequences

• Start with any initial string of n numbers s(1), ..., s(n), with s(1) = 2, other s(i)'s = 2 or 3 (so there are 2^(n-1) starting strings). The rule for extending the string is this as follows: To get s(n+1), write the string s(1)s(2)...s(n) 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. Then a(n) = number of starting strings for which k > 1.at n=17A093370
• a(n) = A121880(2*n)/2.at n=8A211973
• Minimal natural number (in decimal representation) with n prime substrings in base-4 representation (substrings with leading zeros are considered to be nonprime).at n=24A217304
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 395", based on the 5-celled von Neumann neighborhood.at n=17A281750