/- 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. -/ module public import FormalConjecturesUtil

Step difference bound $a(n+1) - a(n) \in {1, 2}$ in mass-redistribution cellular automata

$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.

References:

    A300997

    arxiv/2605.22763 Advancing Mathematics Research with AI-Driven Formal Proof Search by George Tsoukalas et al.

@[expose] public sectionnamespace OeisA300997open List Nat Function Set

$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.

noncomputable def a (n : ℕ) : ℕ := let half_ceil (m : ℕ) : ℕ := (m + 1) / 2 let half_floor (m : ℕ) : ℕ := m / 2 let trim_trailing_zeros (l : List ℕ) : List ℕ := (List.reverse l).dropWhile (fun x => x = 0) |>.reverse let ca_step (config : List ℕ) : List ℕ := let base_masses := config.map half_ceil ++ [0] let received_masses := 0 :: config.map half_floor let next_config_long := List.zipWith Nat.add base_masses received_masses trim_trailing_zeros next_config_long if n = 0 then 0 else let initial_config : List ℕ := [n] let target_config : List ℕ := List.replicate n 1 -- State after t steps, computed by folding ca_step t times using foldl over a range. let S (t : ℕ) : List ℕ := (List.range t).foldl (fun acc _ => ca_step acc) initial_config -- The set of time steps k at which the configuration is stable. let stable_steps : Set ℕ := {k | S k = target_config} -- a(n) is the smallest k in this set, defined by the set infimum (sInf). sInf stable_steps@[category test, AMS 11] lemma a_1 : a 1 = 0 := ⊢ a 1 = 0 All goals completed! 🐙@[category test, AMS 11] lemma a_2 : a 2 = 1 := ⊢ a 2 = 1 ⊢ (have half_ceil := fun m ↦ (m + 1) / 2; have half_floor := fun m ↦ m / 2; have trim_trailing_zeros := fun l ↦ (dropWhile (fun x ↦ decide (x = 0)) l.reverse).reverse; have ca_step := fun config ↦ have base_masses := map half_ceil config ++ [0]; have received_masses := 0 :: map half_floor config; have next_config_long := zipWith Nat.add base_masses received_masses; trim_trailing_zeros next_config_long; if 2 = 0 then 0 else have initial_config := [2]; have target_config := replicate 2 1; have S := fun t ↦ foldl (fun acc x ↦ ca_step acc) initial_config (List.range t); have stable_steps := {k | S k = target_config}; sInf stable_steps) = 1 ⊢ sInf {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [2] (List.range k) = replicate 2 1} = 1 ⊢ 1 ∈ {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [2] (List.range k) = replicate 2 1}⊢ 1 ≤ sInf {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [2] (List.range k) = replicate 2 1} ⊢ 1 ∈ {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [2] (List.range k) = replicate 2 1} ⊢ foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [2] (List.range 1) = replicate 2 1 All goals completed! 🐙 ⊢ 1 ≤ sInf {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [2] (List.range k) = replicate 2 1} h:sInf {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [2] (List.range k) = replicate 2 1} = 0⊢ False h:sInf {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [2] (List.range k) = replicate 2 1} = 0h0:0 ∈ {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [2] (List.range k) = replicate 2 1}⊢ Falseh:sInf {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [2] (List.range k) = replicate 2 1} = 0h0:{k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [2] (List.range k) = replicate 2 1} = ∅⊢ False h:sInf {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [2] (List.range k) = replicate 2 1} = 0h0:0 ∈ {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [2] (List.range k) = replicate 2 1}⊢ False h:sInf {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [2] (List.range k) = replicate 2 1} = 0h0:foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [2] (List.range 0) = replicate 2 1⊢ False exact absurd h0 (h:sInf {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [2] (List.range k) = replicate 2 1} = 0h0:foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [2] (List.range 0) = replicate 2 1⊢ ¬foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [2] (List.range 0) = replicate 2 1 All goals completed! 🐙) h:sInf {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [2] (List.range k) = replicate 2 1} = 0h0:{k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [2] (List.range k) = replicate 2 1} = ∅⊢ False exact absurd h0 (Set.nonempty_iff_ne_empty.mp ⟨1, h:sInf {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [2] (List.range k) = replicate 2 1} = 0h0:{k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [2] (List.range k) = replicate 2 1} = ∅⊢ 1 ∈ {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [2] (List.range k) = replicate 2 1} h:sInf {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [2] (List.range k) = replicate 2 1} = 0h0:{k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [2] (List.range k) = replicate 2 1} = ∅⊢ foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [2] (List.range 1) = replicate 2 1; All goals completed! 🐙⟩)@[category test, AMS 11] lemma a_3 : a 3 = 3 := ⊢ a 3 = 3 ⊢ sInf {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [3] (List.range k) = replicate 3 1} = 3 ⊢ 3 ∈ {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [3] (List.range k) = replicate 3 1}⊢ 3 ∈ lowerBounds {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [3] (List.range k) = replicate 3 1} ⊢ 3 ∈ {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [3] (List.range k) = replicate 3 1} ⊢ foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [3] (List.range 3) = replicate 3 1 All goals completed! 🐙 ⊢ 3 ∈ lowerBounds {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [3] (List.range k) = replicate 3 1} k:ℕhk:k ∈ {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [3] (List.range k) = replicate 3 1}⊢ 3 ≤ k k:ℕhk:foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [3] (List.range k) = replicate 3 1⊢ 3 ≤ k k:ℕhk:foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [3] (List.range k) = replicate 3 1hlt:¬3 ≤ k⊢ False k:ℕhk:foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [3] (List.range k) = replicate 3 1hlt:k < 3⊢ False k:ℕhk:foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [3] (List.range 0) = replicate 3 1hlt:0 < 3⊢ Falsek:ℕhk:foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [3] (List.range 1) = replicate 3 1hlt:1 < 3⊢ Falsek:ℕhk:foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [3] (List.range 2) = replicate 3 1hlt:2 < 3⊢ False k:ℕhk:foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [3] (List.range 0) = replicate 3 1hlt:0 < 3⊢ Falsek:ℕhk:foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [3] (List.range 1) = replicate 3 1hlt:1 < 3⊢ Falsek:ℕhk:foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [3] (List.range 2) = replicate 3 1hlt:2 < 3⊢ False exact absurd hk (k:ℕhk:foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [3] (List.range 2) = replicate 3 1hlt:2 < 3⊢ ¬foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [3] (List.range 2) = replicate 3 1 All goals completed! 🐙)@[category test, AMS 11] lemma a_4 : a 4 = 4 := ⊢ a 4 = 4 ⊢ sInf {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range k) = replicate 4 1} = 4 ⊢ sInf {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range k) = replicate 4 1} ≤ 4⊢ 4 ≤ sInf {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range k) = replicate 4 1} ⊢ sInf {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range k) = replicate 4 1} ≤ 4 ⊢ 4 ∈ {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range k) = replicate 4 1} ⊢ foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range 4) = replicate 4 1 All goals completed! 🐙 ⊢ 4 ≤ sInf {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range k) = replicate 4 1} ⊢ {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range k) = replicate 4 1}.Nonempty⊢ ∀ b ∈ {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range k) = replicate 4 1}, 4 ≤ b ⊢ {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range k) = replicate 4 1}.Nonempty ⊢ 4 ∈ {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range k) = replicate 4 1} ⊢ foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range 4) = replicate 4 1 All goals completed! 🐙 ⊢ ∀ b ∈ {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range k) = replicate 4 1}, 4 ≤ b b:ℕhb:b ∈ {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range k) = replicate 4 1}⊢ 4 ≤ b b:ℕhb:foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range b) = replicate 4 1⊢ 4 ≤ b b:ℕhb:foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range b) = replicate 4 1hb4:¬4 ≤ b⊢ False b:ℕhb:foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range b) = replicate 4 1hb4:b < 4⊢ False b:ℕhb:foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range 0) = replicate 4 1hb4:0 < 4⊢ Falseb:ℕhb:foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range 1) = replicate 4 1hb4:1 < 4⊢ Falseb:ℕhb:foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range 2) = replicate 4 1hb4:2 < 4⊢ Falseb:ℕhb:foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range 3) = replicate 4 1hb4:3 < 4⊢ False b:ℕhb:foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range 0) = replicate 4 1hb4:0 < 4⊢ Falseb:ℕhb:foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range 1) = replicate 4 1hb4:1 < 4⊢ Falseb:ℕhb:foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range 2) = replicate 4 1hb4:2 < 4⊢ Falseb:ℕhb:foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range 3) = replicate 4 1hb4:3 < 4⊢ False exact absurd hb (b:ℕhb:foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range 3) = replicate 4 1hb4:3 < 4⊢ ¬foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [4] (List.range 3) = replicate 4 1 All goals completed! 🐙)key:∀ (s : Set ℕ), 6 ∈ s → (∀ k < 6, k ∉ s) → sInf s = 6⊢ a 5 = 6 key:∀ (s : Set ℕ), 6 ∈ s → (∀ k < 6, k ∉ s) → sInf s = 6⊢ (have half_ceil := fun m ↦ (m + 1) / 2; have half_floor := fun m ↦ m / 2; have trim_trailing_zeros := fun l ↦ (dropWhile (fun x ↦ decide (x = 0)) l.reverse).reverse; have ca_step := fun config ↦ have base_masses := map half_ceil config ++ [0]; have received_masses := 0 :: map half_floor config; have next_config_long := zipWith Nat.add base_masses received_masses; trim_trailing_zeros next_config_long; if 5 = 0 then 0 else have initial_config := [5]; have target_config := replicate 5 1; have S := fun t ↦ foldl (fun acc x ↦ ca_step acc) initial_config (List.range t); have stable_steps := {k | S k = target_config}; sInf stable_steps) = 6 key:∀ (s : Set ℕ), 6 ∈ s → (∀ k < 6, k ∉ s) → sInf s = 6⊢ sInf {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [5] (List.range k) = replicate 5 1} = 6 key:∀ (s : Set ℕ), 6 ∈ s → (∀ k < 6, k ∉ s) → sInf s = 6⊢ 6 ∈ {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [5] (List.range k) = replicate 5 1}key:∀ (s : Set ℕ), 6 ∈ s → (∀ k < 6, k ∉ s) → sInf s = 6⊢ ∀ k < 6, k ∉ {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [5] (List.range k) = replicate 5 1} key:∀ (s : Set ℕ), 6 ∈ s → (∀ k < 6, k ∉ s) → sInf s = 6⊢ 6 ∈ {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [5] (List.range k) = replicate 5 1} key:∀ (s : Set ℕ), 6 ∈ s → (∀ k < 6, k ∉ s) → sInf s = 6⊢ foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [5] (List.range 6) = replicate 5 1 All goals completed! 🐙 key:∀ (s : Set ℕ), 6 ∈ s → (∀ k < 6, k ∉ s) → sInf s = 6⊢ ∀ k < 6, k ∉ {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [5] (List.range k) = replicate 5 1} key:∀ (s : Set ℕ), 6 ∈ s → (∀ k < 6, k ∉ s) → sInf s = 6k:ℕhk:k < 6⊢ k ∉ {k | foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [5] (List.range k) = replicate 5 1} key:∀ (s : Set ℕ), 6 ∈ s → (∀ k < 6, k ∉ s) → sInf s = 6k:ℕhk:k < 6⊢ ¬foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [5] (List.range k) = replicate 5 1 key:∀ (s : Set ℕ), 6 ∈ s → (∀ k < 6, k ∉ s) → sInf s = 6k:ℕhk:0 < 6⊢ ¬foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [5] (List.range 0) = replicate 5 1key:∀ (s : Set ℕ), 6 ∈ s → (∀ k < 6, k ∉ s) → sInf s = 6k:ℕhk:1 < 6⊢ ¬foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [5] (List.range 1) = replicate 5 1key:∀ (s : Set ℕ), 6 ∈ s → (∀ k < 6, k ∉ s) → sInf s = 6k:ℕhk:2 < 6⊢ ¬foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [5] (List.range 2) = replicate 5 1key:∀ (s : Set ℕ), 6 ∈ s → (∀ k < 6, k ∉ s) → sInf s = 6k:ℕhk:3 < 6⊢ ¬foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [5] (List.range 3) = replicate 5 1key:∀ (s : Set ℕ), 6 ∈ s → (∀ k < 6, k ∉ s) → sInf s = 6k:ℕhk:4 < 6⊢ ¬foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [5] (List.range 4) = replicate 5 1key:∀ (s : Set ℕ), 6 ∈ s → (∀ k < 6, k ∉ s) → sInf s = 6k:ℕhk:5 < 6⊢ ¬foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [5] (List.range 5) = replicate 5 1 key:∀ (s : Set ℕ), 6 ∈ s → (∀ k < 6, k ∉ s) → sInf s = 6k:ℕhk:0 < 6⊢ ¬foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [5] (List.range 0) = replicate 5 1key:∀ (s : Set ℕ), 6 ∈ s → (∀ k < 6, k ∉ s) → sInf s = 6k:ℕhk:1 < 6⊢ ¬foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [5] (List.range 1) = replicate 5 1key:∀ (s : Set ℕ), 6 ∈ s → (∀ k < 6, k ∉ s) → sInf s = 6k:ℕhk:2 < 6⊢ ¬foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [5] (List.range 2) = replicate 5 1key:∀ (s : Set ℕ), 6 ∈ s → (∀ k < 6, k ∉ s) → sInf s = 6k:ℕhk:3 < 6⊢ ¬foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [5] (List.range 3) = replicate 5 1key:∀ (s : Set ℕ), 6 ∈ s → (∀ k < 6, k ∉ s) → sInf s = 6k:ℕhk:4 < 6⊢ ¬foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [5] (List.range 4) = replicate 5 1key:∀ (s : Set ℕ), 6 ∈ s → (∀ k < 6, k ∉ s) → sInf s = 6k:ℕhk:5 < 6⊢ ¬foldl (fun acc x ↦ (dropWhile (fun x ↦ decide (x = 0)) (zipWith Nat.add (map (fun m ↦ (m + 1) / 2) acc ++ [0]) (0 :: map (fun m ↦ m / 2) acc)).reverse).reverse) [5] (List.range 5) = replicate 5 1 All 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.

@[category research solved, AMS 11, formal_proof using formal_conjectures at "https://github.com/mo271/formal-conjectures/blob/a32396489dcb8f86c3549b93aa358ac6a10a3a1f/FormalConjectures/OEIS/300997.wip.lean#L1153"] theorem a_succ_eq : ∀ n : ℕ, 1 ≤ n → a (n + 1) = a n + 1 ∨ a (n + 1) = a n + 2 := ⊢ ∀ (n : ℕ), 1 ≤ n → OeisA300997.a (n + 1) = OeisA300997.a n + 1 ∨ OeisA300997.a (n + 1) = OeisA300997.a n + 2 All goals completed! 🐙end OeisA300997