/- 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

Least index $i$ for which $\text{num}(\sigma_1(i)/i) - \text{den}(\sigma_1(i)/i) = n$

Let $A243473(i)$ be the difference between the numerator $p$ and the denominator $q$ when the abundancy index $\sigma_1(i) / i$ is written in lowest terms $p / q$. The sequence $a(n)$ is the least positive integer $i$ such that $A243473(i) = n$, or $0$ if no such index exists.

References:

@[expose] public sectionnamespace OeisA243512open Finset

Numerator minus denominator of $\sigma_1(i) / i$ in lowest terms (A243473).

def abundancyDiff (i : ℕ) : ℕ := if i = 0 then 0 else let r : ℚ := mkRat (∑ d ∈ i.divisors, d) i (r.num - r.den).toNat

Least positive integer $i$ such that abundancyDiff i = n, or $0$ if no such index exists.

noncomputable def a (n : ℕ) : ℕ := sInf {i : ℕ | 0 < i ∧ abundancyDiff i = n}@[category test, AMS 11] theorem a_0 : a 0 = 1 := IsLeast.csInf_eq (⊢ IsLeast {i | 0 < i ∧ abundancyDiff i = 0} 1 All goals completed! 🐙)@[category test, AMS 11] theorem a_1 : a 1 = 2 := IsLeast.csInf_eq (⊢ IsLeast {i | 0 < i ∧ abundancyDiff i = 1} 2 All goals completed! 🐙)@[category test, AMS 11] theorem a_3 : a 3 = 4 := IsLeast.csInf_eq (⊢ IsLeast {i | 0 < i ∧ abundancyDiff i = 3} 4 All goals completed! 🐙)@[category test, AMS 11] theorem a_4 : a 4 = 9 := IsLeast.csInf_eq (⊢ IsLeast {i | 0 < i ∧ abundancyDiff i = 4} 9 All goals completed! 🐙)@[category test, AMS 11] theorem a_5 : a 5 = 14 := IsLeast.csInf_eq (⊢ IsLeast {i | 0 < i ∧ abundancyDiff i = 5} 14 All goals completed! 🐙)

Motivated by the observation that some small numbers $(2, 12, 14, 18, \dots)$ occur only very late in the recently added sequence A243473, but all numbers seem to appear sooner or later. (The definition is completed by "$0$ if no such index exists" to guarantee well-definedness in absence of a proof, but I conjecture that no such $0$ will ever occur.)

@[category research open, AMS 11] theorem conjecture (n : ℕ) : a n ≠ 0 := n:ℕ⊢ a n ≠ 0 All goals completed! 🐙end OeisA243512