/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/modulepublicimportFormalConjecturesUtil
$a(n)$ is the number of steps needed to reach a stable configuration in the 1D cellular
automaton initialized with one cell with mass $n$ and based on the rule "each cell gives half of
its mass, rounded down, to its right neighbor".
The stable configuration is $n$ cells with mass 1.
$a(n)$ is the number of steps needed to reach a stable configuration in the 1D cellular
automaton initialized with one cell with mass $n$ and based on the rule "each cell gives half of
its mass, rounded down, to its right neighbor".
The stable configuration is $n$ cells with mass 1.
noncomputabledefa(n:ℕ):ℕ:=lethalf_ceil(m:ℕ):ℕ:=(m+1)/2lethalf_floor(m:ℕ):ℕ:=m/2lettrim_trailing_zeros(l:Listℕ):Listℕ:=(List.reversel).dropWhile(funx=>x=0)|>.reverseletca_step(config:Listℕ):Listℕ:=letbase_masses:=config.maphalf_ceil++[0]letreceived_masses:=0::config.maphalf_floorletnext_config_long:=List.zipWithNat.addbase_massesreceived_massestrim_trailing_zerosnext_config_longifn=0then0elseletinitial_config:Listℕ:=[n]lettarget_config:Listℕ:=List.replicaten1-- State after t steps, computed by folding ca_step t times using foldl over a range.letS(t:ℕ):Listℕ:=(List.ranget).foldl(funacc_=>ca_stepacc)initial_config-- The set of time steps k at which the configuration is stable.letstable_steps:Setℕ:={k|Sk=target_config}-- a(n) is the smallest k in this set, defined by the set infimum (sInf).sInfstable_steps@[categorytest,AMS11]lemmaa_1:a1=0:=⊢ a1=0All goals completed! 🐙@[categorytest,AMS11]lemmaa_2:a2=1:=⊢ a2=1⊢ (havehalf_ceil:=funm↦(m+1)/2;havehalf_floor:=funm↦m/2;havetrim_trailing_zeros:=funl↦(dropWhile(funx↦decide(x=0))l.reverse).reverse;haveca_step:=funconfig↦havebase_masses:=maphalf_ceilconfig++[0];havereceived_masses:=0::maphalf_floorconfig;havenext_config_long:=zipWithNat.addbase_massesreceived_masses;trim_trailing_zerosnext_config_long;if2=0then0elsehaveinitial_config:=[2];havetarget_config:=replicate21;haveS:=funt↦foldl(funaccx↦ca_stepacc)initial_config(List.ranget);havestable_steps:={k|Sk=target_config};sInfstable_steps)=1⊢ sInf{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[2](List.rangek)=replicate21}=1⊢ 1∈{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[2](List.rangek)=replicate21}⊢ 1≤sInf{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[2](List.rangek)=replicate21}⊢ 1∈{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[2](List.rangek)=replicate21}⊢ foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[2](List.range1)=replicate21All goals completed! 🐙⊢ 1≤sInf{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[2](List.rangek)=replicate21}h:sInf{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[2](List.rangek)=replicate21}=0⊢ Falseh:sInf{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[2](List.rangek)=replicate21}=0h0:0∈{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[2](List.rangek)=replicate21}⊢ Falseh:sInf{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[2](List.rangek)=replicate21}=0h0:{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[2](List.rangek)=replicate21}=∅⊢ Falseh:sInf{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[2](List.rangek)=replicate21}=0h0:0∈{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[2](List.rangek)=replicate21}⊢ Falseh:sInf{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[2](List.rangek)=replicate21}=0h0:foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[2](List.range0)=replicate21⊢ Falseexactabsurdh0(h:sInf{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[2](List.rangek)=replicate21}=0h0:foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[2](List.range0)=replicate21⊢ ¬foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[2](List.range0)=replicate21All goals completed! 🐙)h:sInf{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[2](List.rangek)=replicate21}=0h0:{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[2](List.rangek)=replicate21}=∅⊢ Falseexactabsurdh0(Set.nonempty_iff_ne_empty.mp⟨1,h:sInf{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[2](List.rangek)=replicate21}=0h0:{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[2](List.rangek)=replicate21}=∅⊢ 1∈{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[2](List.rangek)=replicate21}h:sInf{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[2](List.rangek)=replicate21}=0h0:{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[2](List.rangek)=replicate21}=∅⊢ foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[2](List.range1)=replicate21;All goals completed! 🐙⟩)@[categorytest,AMS11]lemmaa_3:a3=3:=⊢ a3=3⊢ sInf{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[3](List.rangek)=replicate31}=3⊢ 3∈{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[3](List.rangek)=replicate31}⊢ 3∈lowerBounds{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[3](List.rangek)=replicate31}⊢ 3∈{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[3](List.rangek)=replicate31}⊢ foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[3](List.range3)=replicate31All goals completed! 🐙⊢ 3∈lowerBounds{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[3](List.rangek)=replicate31}k:ℕhk:k∈{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[3](List.rangek)=replicate31}⊢ 3≤kk:ℕhk:foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[3](List.rangek)=replicate31⊢ 3≤kk:ℕhk:foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[3](List.rangek)=replicate31hlt:¬3≤k⊢ Falsek:ℕhk:foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[3](List.rangek)=replicate31hlt:k<3⊢ Falsek:ℕhk:foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[3](List.range0)=replicate31hlt:0<3⊢ Falsek:ℕhk:foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[3](List.range1)=replicate31hlt:1<3⊢ Falsek:ℕhk:foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[3](List.range2)=replicate31hlt:2<3⊢ Falsek:ℕhk:foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[3](List.range0)=replicate31hlt:0<3⊢ Falsek:ℕhk:foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[3](List.range1)=replicate31hlt:1<3⊢ Falsek:ℕhk:foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[3](List.range2)=replicate31hlt:2<3⊢ Falseexactabsurdhk(k:ℕhk:foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[3](List.range2)=replicate31hlt:2<3⊢ ¬foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[3](List.range2)=replicate31All goals completed! 🐙)@[categorytest,AMS11]lemmaa_4:a4=4:=⊢ a4=4⊢ sInf{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.rangek)=replicate41}=4⊢ sInf{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.rangek)=replicate41}≤4⊢ 4≤sInf{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.rangek)=replicate41}⊢ sInf{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.rangek)=replicate41}≤4⊢ 4∈{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.rangek)=replicate41}⊢ foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.range4)=replicate41All goals completed! 🐙⊢ 4≤sInf{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.rangek)=replicate41}⊢ {k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.rangek)=replicate41}.Nonempty⊢ ∀b∈{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.rangek)=replicate41},4≤b⊢ {k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.rangek)=replicate41}.Nonempty⊢ 4∈{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.rangek)=replicate41}⊢ foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.range4)=replicate41All goals completed! 🐙⊢ ∀b∈{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.rangek)=replicate41},4≤bb:ℕhb:b∈{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.rangek)=replicate41}⊢ 4≤bb:ℕhb:foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.rangeb)=replicate41⊢ 4≤bb:ℕhb:foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.rangeb)=replicate41hb4:¬4≤b⊢ Falseb:ℕhb:foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.rangeb)=replicate41hb4:b<4⊢ Falseb:ℕhb:foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.range0)=replicate41hb4:0<4⊢ Falseb:ℕhb:foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.range1)=replicate41hb4:1<4⊢ Falseb:ℕhb:foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.range2)=replicate41hb4:2<4⊢ Falseb:ℕhb:foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.range3)=replicate41hb4:3<4⊢ Falseb:ℕhb:foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.range0)=replicate41hb4:0<4⊢ Falseb:ℕhb:foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.range1)=replicate41hb4:1<4⊢ Falseb:ℕhb:foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.range2)=replicate41hb4:2<4⊢ Falseb:ℕhb:foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.range3)=replicate41hb4:3<4⊢ Falseexactabsurdhb(b:ℕhb:foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.range3)=replicate41hb4:3<4⊢ ¬foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[4](List.range3)=replicate41All goals completed! 🐙)key:∀(s:Setℕ),6∈s→(∀k<6,k∉s)→sInfs=6⊢ a5=6unfoldakey:∀(s:Setℕ),6∈s→(∀k<6,k∉s)→sInfs=6⊢ (havehalf_ceil:=funm↦(m+1)/2;havehalf_floor:=funm↦m/2;havetrim_trailing_zeros:=funl↦(dropWhile(funx↦decide(x=0))l.reverse).reverse;haveca_step:=funconfig↦havebase_masses:=maphalf_ceilconfig++[0];havereceived_masses:=0::maphalf_floorconfig;havenext_config_long:=zipWithNat.addbase_massesreceived_masses;trim_trailing_zerosnext_config_long;if5=0then0elsehaveinitial_config:=[5];havetarget_config:=replicate51;haveS:=funt↦foldl(funaccx↦ca_stepacc)initial_config(List.ranget);havestable_steps:={k|Sk=target_config};sInfstable_steps)=6norm_numkey:∀(s:Setℕ),6∈s→(∀k<6,k∉s)→sInfs=6⊢ sInf{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[5](List.rangek)=replicate51}=6applykeyakey:∀(s:Setℕ),6∈s→(∀k<6,k∉s)→sInfs=6⊢ 6∈{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[5](List.rangek)=replicate51}akey:∀(s:Setℕ),6∈s→(∀k<6,k∉s)→sInfs=6⊢ ∀k<6,k∉{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[5](List.rangek)=replicate51}·akey:∀(s:Setℕ),6∈s→(∀k<6,k∉s)→sInfs=6⊢ 6∈{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[5](List.rangek)=replicate51}simponly[Set.mem_ofPred_eq]akey:∀(s:Setℕ),6∈s→(∀k<6,k∉s)→sInfs=6⊢ foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[5](List.range6)=replicate51decideAll goals completed! 🐙·akey:∀(s:Setℕ),6∈s→(∀k<6,k∉s)→sInfs=6⊢ ∀k<6,k∉{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[5](List.rangek)=replicate51}introkhkakey:∀(s:Setℕ),6∈s→(∀k<6,k∉s)→sInfs=6k:ℕhk:k<6⊢ k∉{k|foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[5](List.rangek)=replicate51}simponly[Set.mem_ofPred_eq]akey:∀(s:Setℕ),6∈s→(∀k<6,k∉s)→sInfs=6k:ℕhk:k<6⊢ ¬foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[5](List.rangek)=replicate51interval_caseska.«0»key:∀(s:Setℕ),6∈s→(∀k<6,k∉s)→sInfs=6k:ℕhk:0<6⊢ ¬foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[5](List.range0)=replicate51a.«1»key:∀(s:Setℕ),6∈s→(∀k<6,k∉s)→sInfs=6k:ℕhk:1<6⊢ ¬foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[5](List.range1)=replicate51a.«2»key:∀(s:Setℕ),6∈s→(∀k<6,k∉s)→sInfs=6k:ℕhk:2<6⊢ ¬foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[5](List.range2)=replicate51a.«3»key:∀(s:Setℕ),6∈s→(∀k<6,k∉s)→sInfs=6k:ℕhk:3<6⊢ ¬foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[5](List.range3)=replicate51a.«4»key:∀(s:Setℕ),6∈s→(∀k<6,k∉s)→sInfs=6k:ℕhk:4<6⊢ ¬foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[5](List.range4)=replicate51a.«5»key:∀(s:Setℕ),6∈s→(∀k<6,k∉s)→sInfs=6k:ℕhk:5<6⊢ ¬foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[5](List.range5)=replicate51<;>a.«0»key:∀(s:Setℕ),6∈s→(∀k<6,k∉s)→sInfs=6k:ℕhk:0<6⊢ ¬foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[5](List.range0)=replicate51a.«1»key:∀(s:Setℕ),6∈s→(∀k<6,k∉s)→sInfs=6k:ℕhk:1<6⊢ ¬foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[5](List.range1)=replicate51a.«2»key:∀(s:Setℕ),6∈s→(∀k<6,k∉s)→sInfs=6k:ℕhk:2<6⊢ ¬foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[5](List.range2)=replicate51a.«3»key:∀(s:Setℕ),6∈s→(∀k<6,k∉s)→sInfs=6k:ℕhk:3<6⊢ ¬foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[5](List.range3)=replicate51a.«4»key:∀(s:Setℕ),6∈s→(∀k<6,k∉s)→sInfs=6k:ℕhk:4<6⊢ ¬foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[5](List.range4)=replicate51a.«5»key:∀(s:Setℕ),6∈s→(∀k<6,k∉s)→sInfs=6k:ℕhk:5<6⊢ ¬foldl(funaccx↦(dropWhile(funx↦decide(x=0))(zipWithNat.add(map(funm↦(m+1)/2)acc++[0])(0::map(funm↦m/2)acc)).reverse).reverse)[5](List.range5)=replicate51decideAll goals completed! 🐙
Conjecture: It appears that the finite difference of this sequence only contains 1's and 2's.
A formal proof has been found with the methods described in
arxiv/2605.22763.