A319954 Infinite word over {0,1,2} formed from list of binary words of lengths 0, 1, 2, etc., including empty word, each prefixed by a 2.

2, 2, 0, 2, 1, 2, 0, 0, 2, 0, 1, 2, 1, 0, 2, 1, 1, 2, 0, 0, 0, 2, 0, 0, 1, 2, 0, 1, 0, 2, 0, 1, 1, 2, 1, 0, 0, 2, 1, 0, 1, 2, 1, 1, 0, 2, 1, 1, 1, 2, 0, 0, 0, 0, 2, 0, 0, 0, 1, 2, 0, 0, 1, 0, 2, 0, 0, 1, 1, 2, 0, 1, 0, 0, 2, 0, 1, 0, 1, 2, 0, 1, 1, 0, 2, 0, 1

Offset: 0

Author

N. J. A. Sloane, Oct 04 2018

Keywords

• nonn
• base

Examples

			The word written without commas:
220212002012102112000200120102011210021012110211120000200012001020011...
		

Links

• Rémy Sigrist, Table of n, a(n) for n = 0..25000
• Carl Pomerance, John Michael Robson, and Jeffrey Shallit, Automaticity II: Descriptional complexity in the unary case, Theoretical computer science 180.1-2 (1997): 181-201.

Crossrefs

Cf. A001855, A030302, A214339, A319953.

Programs

PARI

k=0; for (n=0, oo, b=binary(n+1); b[1]++; for (i=1, #b, print1 (b[i] ", "); if (k++==87, quit))) \\ Rémy Sigrist, Oct 04 2018

Formula

a(n) = A030302(n+1) + [n belongs to A001855] (where [] is an Iverson bracket). - Rémy Sigrist, Oct 04 2018

Extensions

Data corrected and extended by Rémy Sigrist, Oct 04 2018