Anonymous user
Summarize and say sequence: Difference between revisions
m
added highlighting to the sequences shown in the task's preamble, moved the "see" (link to OEIS) to the bottom of the task's preamble.
m (→{{header|REXX}}: used a better program description.) |
m (added highlighting to the sequences shown in the task's preamble, moved the "see" (link to OEIS) to the bottom of the task's preamble.) |
||
Line 1:
{{task}}
There are several ways to generate a self-referential sequence. One very common one (the [[Look-and-say sequence]]) is to start with a positive integer, then generate the next term by concatenating enumerated groups of adjacent alike digits:
0, 10, 1110, 3110, 132110, 1113122110, 311311222110 ...▼
▲0, 10, 1110, 3110, 132110, 1113122110, 311311222110 ...
The terms generated grow in length geometrically and never converge.
Line 9 ⟶ 7:
Count how many of each alike digit there is, then concatenate the sum and digit for each of the sorted enumerated digits. Note that the first five terms are the same as for the previous sequence.
0, 10, 1110, 3110, 132110, 13123110, 23124110 ...
▲0, 10, 1110, 3110, 132110, 13123110, 23124110 ... see [[oeis:A036058|The On-Line Encyclopedia of Integer Sequences]]
Sort the digits largest to smallest. Do not include counts of digits that do not appear in the previous term.
Line 54 ⟶ 50:
* [[Self-describing numbers]]
* [[Spelling of ordinal numbers]]
;Also see:
* [[oeis:A036058|The On-Line Encyclopedia of Integer Sequences]].
<br><br>
| |||