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

A logarithmic derivative with prime-divisible coefficients

Let $F(x)$ be the generating function of A381353, with $F(0)=1$, $[x]F(x)=1$, and $[x^n]F(x)^{p_n}=0$ for $n>1$, where $p_n$ is the $n$-th prime. The sequence is defined by $\sum_{n\ge1}a(n)x^n=xF'(x)/F(x)$.

References:

@[expose] public sectionnamespace OeisA381355open PowerSeries

The $n$-th prime, indexed from $p_1=2$.

noncomputable def primeN (n : ℕ) : ℕ := Nat.nth Nat.Prime (n - 1)

The coefficients of $F$, obtained successively from $[x^n]F(x)^{p_n}=0$.

noncomputable def f : ℕ → ℤ := Nat.strongRec fun n ih => if n = 0 then 1 else if n = 1 then 1 else -(coeff n (PowerSeries.mk (fun k => if h : k < n then ih k h else 0) ^ primeN n) / (primeN n : ℤ))

The generating function of A381353.

noncomputable def series : PowerSeries ℤ := PowerSeries.mk f

The coefficients of $xF'(x)/F(x)$.

noncomputable def a (n : ℕ) : ℤ := coeff n (X * derivative ℤ series * invOfUnit series 1)n:ℕ⊢ (if n = 0 then 1 else if n = 1 then 1 else -((coeff n) ((mk fun k ↦ if h : k < n then (fun m x ↦ Nat.strongRec (fun n ih ↦ if n = 0 then 1 else if n = 1 then 1 else -((coeff n) ((mk fun k ↦ if h : k < n then ih k h else 0) ^ primeN n) / ↑(primeN n))) m) k h else 0) ^ primeN n) / ↑(primeN n))) = if n = 0 then 1 else if n = 1 then 1 else -((coeff n) ((mk fun k ↦ if k < n then f k else 0) ^ primeN n) / ↑(primeN n)) All goals completed! 🐙⊢ (if 0 = 0 then 1 else if 0 = 1 then 1 else -((coeff 0) ((mk fun k ↦ if k < 0 then f k else 0) ^ primeN 0) / ↑(primeN 0))) = 1; All goals completed! 🐙⊢ (if 1 = 0 then 1 else if 1 = 1 then 1 else -((coeff 1) ((mk fun k ↦ if k < 1 then f k else 0) ^ primeN 1) / ↑(primeN 1))) = 1; All goals completed! 🐙All goals completed! 🐙All goals completed! 🐙⊢ (if 2 = 0 then 1 else if 2 = 1 then 1 else -((coeff 2) ((mk fun k ↦ if k < 2 then f k else 0) ^ primeN 2) / ↑(primeN 2))) = -1 All goals completed! 🐙⊢ (if 3 = 0 then 1 else if 3 = 1 then 1 else -((coeff 3) ((mk fun k ↦ if k < 3 then f k else 0) ^ primeN 3) / ↑(primeN 3))) = 2 All goals completed! 🐙All goals completed! 🐙All goals completed! 🐙@[category API, AMS 11] private lemma coeff_ofNat (n k : ℕ) [k.AtLeastTwo] : coeff n (ofNat(k) : PowerSeries ℤ) = if n = 0 then (ofNat(k) : ℤ) else 0 := n:ℕk:ℕinst✝:k.AtLeastTwo⊢ (coeff n) (OfNat.ofNat k) = if n = 0 then OfNat.ofNat k else 0 All goals completed! 🐙@[category API, AMS 11] private lemma coeff_ofNat_mul (n k : ℕ) [k.AtLeastTwo] (G : PowerSeries ℤ) : coeff n ((ofNat(k) : PowerSeries ℤ) * G) = (ofNat(k) : ℤ) * coeff n G := n:ℕk:ℕinst✝:k.AtLeastTwoG:ℤ⟦X⟧⊢ (coeff n) (OfNat.ofNat k * G) = OfNat.ofNat k * (coeff n) G All goals completed! 🐙ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ -((coeff 4) ((1 + X - X ^ 2 + 2 * X ^ 3) ^ 7) / 7) = -5 ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ -((coeff 4) (1 + X * 7 + X ^ 2 * 14 + X ^ 3 * 7 + X ^ 4 * 35 + X ^ 5 * 112 + X ^ 6 * 21 + X ^ 7 * 29 + X ^ 8 * 427 - X ^ 10 * 175 + X ^ 11 * 1057 - X ^ 12 * 294 - X ^ 13 * 427 + X ^ 14 * 1735 - X ^ 15 * 1134 + X ^ 16 * 140 + X ^ 17 * 1288 - X ^ 18 * 1456 + X ^ 19 * 1120 - X ^ 20 * 448 + X ^ 21 * 128) / 7) = -5 All goals completed! 🐙ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ -((coeff 5) ((1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4) ^ 11) / 11) = 13 ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ -((coeff 5) (1 + X * 11 + X ^ 2 * 44 + X ^ 3 * 77 + X ^ 4 * 55 - X ^ 5 * 143 - X ^ 6 * 1078 - X ^ 7 * 2222 - X ^ 8 * 1331 - X ^ 9 * 110 + X ^ 10 * 10769 + X ^ 11 * 32429 + X ^ 12 * 8756 + X ^ 13 * 11473 - X ^ 14 * 36740 - X ^ 15 * 331738 + X ^ 16 * 42427 - X ^ 17 * 62612 - X ^ 18 * 350581 + X ^ 19 * 2753245 - X ^ 20 * 1428350 + X ^ 21 * 120505 + X ^ 22 * 5650820 - X ^ 23 * 19285750 + X ^ 24 * 16905130 - X ^ 25 * 5143699 - X ^ 26 * 34672429 + X ^ 27 * 104961164 - X ^ 28 * 128245733 + X ^ 29 * 93386920 + X ^ 30 * 64320454 - X ^ 31 * 347501176 + X ^ 32 * 577229411 - X ^ 33 * 662649227 + X ^ 34 * 425239430 + X ^ 35 * 190639625 - X ^ 36 * 947395625 + X ^ 37 * 1669146875 - X ^ 38 * 2070681250 + X ^ 39 * 2001312500 - X ^ 40 * 1615625000 + X ^ 41 * 1052734375 - X ^ 42 * 537109375 + X ^ 43 * 214843750 - X ^ 44 * 48828125) / 11) = 13 All goals completed! 🐙n:ℕ⊢ (if n = 0 then ↑1⁻¹ else -↑1⁻¹ * ∑ x ∈ Finset.HasAntidiagonal.antidiagonal n, if x.2 < n then (coeff x.1) series * (coeff x.2) (series.invOfUnit 1) else 0) = if n = 0 then 1 else -∑ k ∈ Finset.range (n + 1), if n - k < n then f k * (coeff (n - k)) (series.invOfUnit 1) else 0 All goals completed! 🐙⊢ (if 0 = 0 then 1 else -∑ k ∈ Finset.range (0 + 1), if 0 - k < 0 then f k * (coeff (0 - k)) (series.invOfUnit 1) else 0) = 1 All goals completed! 🐙⊢ (if 1 = 0 then 1 else -∑ k ∈ Finset.range (1 + 1), if 1 - k < 1 then f k * (coeff (1 - k)) (series.invOfUnit 1) else 0) = -1 All goals completed! 🐙⊢ (if 2 = 0 then 1 else -∑ k ∈ Finset.range (2 + 1), if 2 - k < 2 then f k * (coeff (2 - k)) (series.invOfUnit 1) else 0) = 2 All goals completed! 🐙⊢ (if 3 = 0 then 1 else -∑ k ∈ Finset.range (3 + 1), if 3 - k < 3 then f k * (coeff (3 - k)) (series.invOfUnit 1) else 0) = -5 All goals completed! 🐙⊢ (if 4 = 0 then 1 else -∑ k ∈ Finset.range (4 + 1), if 4 - k < 4 then f k * (coeff (4 - k)) (series.invOfUnit 1) else 0) = 14 All goals completed! 🐙n:ℕ⊢ ∑ k ∈ Finset.range (n + 1), (coeff k) ((d⁄dX ℤ) series) * (coeff (n - k)) (series.invOfUnit 1) = ∑ k ∈ Finset.range (n + 1), f (k + 1) * (↑k + 1) * (coeff (n - k)) (series.invOfUnit 1) All goals completed! 🐙⊢ ∑ k ∈ Finset.range (0 + 1), f (k + 1) * (↑k + 1) * (coeff (0 - k)) (series.invOfUnit 1) = 1 All goals completed! 🐙⊢ ∑ k ∈ Finset.range (1 + 1), f (k + 1) * (↑k + 1) * (coeff (1 - k)) (series.invOfUnit 1) = -3 All goals completed! 🐙⊢ ∑ k ∈ Finset.range (2 + 1), f (k + 1) * (↑k + 1) * (coeff (2 - k)) (series.invOfUnit 1) = 10 All goals completed! 🐙⊢ ∑ k ∈ Finset.range (3 + 1), f (k + 1) * (↑k + 1) * (coeff (3 - k)) (series.invOfUnit 1) = -35 All goals completed! 🐙⊢ ∑ k ∈ Finset.range (4 + 1), f (k + 1) * (↑k + 1) * (coeff (4 - k)) (series.invOfUnit 1) = 121 All goals completed! 🐙

"Conjecture: $a(n)$ is divisible by $\operatorname{prime}(n)$ for $n > 1$."

    Paul D. Hanna, Mar 11 2025.

Proved and formalized in Lean by Wentao Li, with AI assistance; see [Li26].

@[category research solved, AMS 11, formal_proof using lean4 at "https://github.com/VictorLiwentao/lean-oeis-proofs/blob/0a23974e54b90afd1453ef02c27cf8f617bad940/LeanOeisProofs/NewProofs/A381355.lean#L380"] theorem conjecture (n : ℕ) (hn : 1 < n) : (primeN n : ℤ) ∣ a n := n:ℕhn:1 < n⊢ ↑(primeN n) ∣ a n All goals completed! 🐙end OeisA381355