login
This site is supported by donations 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
1, 3, 11, 13, 31, 111, 113, 131, 133, 311, 1113, 1131, 1133, 1311, 1331, 3111, 3113, 11131, 11133, 11311, 11331, 13111, 13113, 13311, 31131, 31133, 111311, 111331, 113111, 113311, 311311, 311331, 1113111, 1113311, 3113111, 3113311 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

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

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

LINKS

Table of n, a(n) for n=1..36.

R. A. Litherland, Conway’s Cosmological Theorem

CROSSREFS

Cf. A005150.

Sequence in context: A125308 A260044 A199303 * A020451 A018450 A302304

Adjacent sequences:  A244044 A244045 A244046 * A244048 A244049 A244050

KEYWORD

nonn,fini,full,base

AUTHOR

Arkadiusz Wesolowski, Jun 18 2014

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 16 11:51 EDT 2019. Contains 328056 sequences. (Running on oeis4.)