Add "Kolakoski" holes

JRaspass · JRaspass · commit 1d9ce0d99790 · 2021-01-16T22:57:45.000Z
diff --git a/db/a-schema.sql b/db/a-schema.sql
@@ -5,7 +5,8 @@ CREATE TYPE hole AS ENUM (
     '12-days-of-christmas', '99-bottles-of-beer', 'abundant-numbers',
     'arabic-to-roman', 'brainfuck', 'christmas-trees', 'css-colors', 'cubes',
     'diamonds', 'divisors', 'emirp-numbers', 'emojify', 'evil-numbers',
-    'fibonacci', 'fizz-buzz', 'happy-numbers', 'intersection', 'leap-years',
+    'fibonacci', 'fizz-buzz', 'happy-numbers', 'intersection',
+    'kolakoski-constant', 'kolakoski-sequence', 'leap-years',
     'levenshtein-distance', 'leyland-numbers', 'look-and-say',
     'lucky-tickets', 'morse-decoder', 'morse-encoder', 'niven-numbers',
     'odious-numbers', 'ordinal-numbers', 'pangram-grep', 'pascals-triangle',
diff --git a/holes.toml b/holes.toml
@@ -794,44 +794,43 @@ preamble = '''
 
 ['Kolakoski Constant']
 category = 'Mathematics'
-experiment = -1
 links = [
-   { name = 'Wikipedia', url = '//www.wikipedia.org/wiki/Kolakoski_sequence#Kolakoski_Constant' }
+   { name = 'Wikipedia', url = '//www.wikipedia.org/wiki/Kolakoski_sequence#Kolakoski_Constant' },
 ]
 preamble = '''
 <p>
     The Kolakoski constant is created by taking the
-    <a href="kolakoski-sequence"> Kolakoski sequence </a>
-    and subtracting one from each element then interpreting it as a binary fraction.
+    <a href=kolakoski-sequence>Kolakoski sequence</a> and subtracting one from
+    each element then interpreting it as a binary fraction.
 
 <pre>
     1 221121221221121122121121…
     0.110010110110010011010010…
     0.7945071927…
 </pre>
 
-<p> Print the Kolakoski constant to the first 1,000 decimal places </p>
+<p>Print the Kolakoski constant to the first 1,000 decimal places.
 '''
 
 ['Kolakoski Sequence']
 category = 'Sequence'
-experiment = -1
 links = [
+    { name = 'OEIS A000002', url = '//oeis.org/A000002' },
     { name = 'Rosetta Code', url = '//rosettacode.org/wiki/Kolakoski_sequence' },
-    { name = 'OEIS A000002', url = '//oeis.org/A000002' }
 ]
 preamble = '''
 <p>
-    The Kolakoski sequence is a self referential sequence where the nth element
-    is the length of the nth run of same numbers in the sequence.
+    The Kolakoski sequence is a self referential sequence where the nth
+    element is the length of the nth run of same numbers in the sequence.
     This has the interesting property where if you take the run lengths of
-    this sequence, then you will get the same sequence back again.
-    For example, the sequence starting with (1, 2) looks like:
+    this sequence, then you will get the same sequence back again. For
+    example, the sequence starting with (1, 2) looks like:
 
 <pre>
     1 2 2 1 1 2 1 2 2 1 2 2 1 1 2 1 1 2 2 1 2 1 1 2 1…
     1  2   2  1 1  2  1  2   2  1  2   2  1 1  2  1 1…
 </pre>
+
 <p>
     Beginning with (1, 2) output the first 1000 elements in the Kolakoski
     sequence, separated by spaces.
