login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A321485
Describe n from left to right in terms of blocks with the maximum number of repetitions (and then with the maximum size).
2
10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 110, 21, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 22, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 23, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 24, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154
OFFSET
0,1
COMMENTS
This sequence is a variant of the "Look and Say" sequence A045918 with features from Gijswijt's sequence A090822.
Any digit appearing in n also appears in a(n).
LINKS
FORMULA
a((10^k-1)/9 * d) = 10*k + d for any k > 0 and d = 1..9.
A055642(a(n)) <= 1 + A055642(n).
EXAMPLE
The following table shows some examples with the corresponding blocks:
n a(n) Blocks
-------- ------ ---------------
0 10 (0)
1 11 (1)
12 112 (12)
100 1100 (100)
111 31 (1|1|1)
22123 221123 (2|2)(123)
112211 212221 (1|1)(2|2)(1|1)
212212 2212 (212|212)
11221122 21122 (1122|1122)
PROG
(PARI) See Links section.
CROSSREFS
Sequence in context: A262390 A102236 A250040 * A047842 A047843 A097598
KEYWORD
nonn,base
AUTHOR
Rémy Sigrist, Nov 11 2018
STATUS
approved