login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A244047 Maximal nonempty {1,3}-chunks of a 4-day-old string in a "Look and Say" sequence. 0

%I #7 Dec 11 2015 22:00:14

%S 1,3,11,13,31,111,113,131,133,311,1113,1131,1133,1311,1331,3111,3113,

%T 11131,11133,11311,11331,13111,13113,13311,31131,31133,111311,111331,

%U 113111,113311,311311,311331,1113111,1113311,3113111,3113311

%N Maximal nonempty {1,3}-chunks of a 4-day-old string in a "Look and Say" sequence.

%C A chunk of a string is a substring of consecutive digits.

%C A 4-day-old string has no chunks of the form 233, 13112 or 13312.

%H R. A. Litherland, <a href="https://www.math.lsu.edu/~lither/jhc/cct.pdf">Conway’s Cosmological Theorem</a>

%Y Cf. A005150.

%K nonn,fini,full,base

%O 1,2

%A _Arkadiusz Wesolowski_, Jun 18 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)