A209234 A two-digit Look-and-Say sequence starting with 10: each term summarizes the increasing two-digit substrings of the previous term.

10, 110, 110111, 101110311, 101103210311131, 101203310311113121231132, 101203210411312213120121123431132133, 201103104210311512413220421122123331232133134141143, 101203204310411412313214115220421222223124431232333134341242143151

Offset: 0

Author

Reinhard Zumkeller, Jan 13 2013

Keywords

• nonn
• base
• look

Examples

			a(0) = 10: 1x10 --> a(1)=110;
a(1) = 110: 1x10 and 1x11 --> a(2)=110111;
a(2) = 110111: 1x01, 1x10 and 3x11 -> a(3)=101110311;
a(3) = 101110311: 1x01, 1x03, 2x10, 3x11 and 1x31 -> a(4)=101103210311131.
		

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 0..1000
• Eric Weisstein's World of Mathematics, Look and Say Sequence
• Wikipedia, Look-and-say sequence
• Reinhard Zumkeller, Haskell program for two-digit Look-and-Say sequences

Crossrefs

Cf. A005151, A047842, A001155.

Cf. A209233 (start=11), A221368 (start=12), A221369 (start=13), A221372 (start=19), A221373 (start=99).

Programs

Haskell

-- See Link.