/-
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.
-/
import FormalConjecturesUtilConjectures associated with A110854
$a(n) = \mathrm{prime}(2n+2) - \mathrm{prime}(2n+1) - \mathrm{prime}(2n) + \mathrm{prime}(2n-1)$, where $\mathrm{prime}(k)$ is the $k$-th prime number.
References:
namespace OeisA110854open Nat
The primary defining sequence a.
$a(n)$ is $\mathrm{prime}(2n+2) - \mathrm{prime}(2n+1) - \mathrm{prime}(2n) + \mathrm{prime}(2n-1)$.
noncomputable def a (n : ℕ) : ℤ :=
let p (k : ℕ) : ℤ := (Nat.nth Nat.Prime (k - 1)).cast
if n = 0 then 0
else p (2 * n + 2) - p (2 * n + 1) - p (2 * n) + p (2 * n - 1)h1:Nat.Prime 13⊢ nth Nat.Prime 5 = 13
exact Nat.nth_count h1 All goals completed! 🐙
@[category API, AMS 11]
lemma nth_prime_six : Nat.nth Nat.Prime 6 = 17 := by ⊢ nth Nat.Prime 6 = 17
have h1 : (17).Prime := by decide h1:Nat.Prime 17⊢ nth Nat.Prime 6 = 17 h1:Nat.Prime 17⊢ nth Nat.Prime 6 = 17
exact Nat.nth_count h1 All goals completed! 🐙
@[category API, AMS 11]
lemma nth_prime_seven : Nat.nth Nat.Prime 7 = 19 := by ⊢ nth Nat.Prime 7 = 19
have h1 : (19).Prime := by decide h1:Nat.Prime 19⊢ nth Nat.Prime 7 = 19 h1:Nat.Prime 19⊢ nth Nat.Prime 7 = 19
exact Nat.nth_count h1 All goals completed! 🐙
@[category API, AMS 11]
lemma nth_prime_eight : Nat.nth Nat.Prime 8 = 23 := by ⊢ nth Nat.Prime 8 = 23
have h1 : (23).Prime := by decide h1:Nat.Prime 23⊢ nth Nat.Prime 8 = 23 h1:Nat.Prime 23⊢ nth Nat.Prime 8 = 23
exact Nat.nth_count h1 All goals completed! 🐙
@[category API, AMS 11]
lemma nth_prime_nine : Nat.nth Nat.Prime 9 = 29 := by ⊢ nth Nat.Prime 9 = 29
have h1 : (29).Prime := by decide h1:Nat.Prime 29⊢ nth Nat.Prime 9 = 29 h1:Nat.Prime 29⊢ nth Nat.Prime 9 = 29
exact Nat.nth_count h1 All goals completed! 🐙Term theorems verifying the first few values of the sequence against the official OEIS b-file
@[category test, AMS 11]
theorem a_0 : a 0 = 0 := by ⊢ a 0 = 0
rfl All goals completed! 🐙@[category test, AMS 11]
theorem a_1 : a 1 = 1 := by ⊢ a 1 = 1
dsimp [a] ⊢ ↑(nth Nat.Prime 3) - ↑(nth Nat.Prime 2) - ↑(nth Nat.Prime 1) + ↑(nth Nat.Prime 0) = 1
norm_num All goals completed! 🐙
@[category test, AMS 11]
theorem a_2 : a 2 = 0 := by ⊢ a 2 = 0
dsimp [a] ⊢ ↑(nth Nat.Prime 5) - ↑(nth Nat.Prime 4) - ↑(nth Nat.Prime 3) + ↑(nth Nat.Prime 2) = 0
rw [nth_prime_five, ⊢ ↑13 - ↑(nth Nat.Prime 4) - ↑(nth Nat.Prime 3) + ↑(nth Nat.Prime 2) = 0 ⊢ ↑13 - ↑11 - ↑7 + ↑5 = 0 Nat.nth_prime_four_eq_eleven, ⊢ ↑13 - ↑11 - ↑(nth Nat.Prime 3) + ↑(nth Nat.Prime 2) = 0 ⊢ ↑13 - ↑11 - ↑7 + ↑5 = 0 Nat.nth_prime_three_eq_seven, ⊢ ↑13 - ↑11 - ↑7 + ↑(nth Nat.Prime 2) = 0 ⊢ ↑13 - ↑11 - ↑7 + ↑5 = 0
Nat.nth_prime_two_eq_five ⊢ ↑13 - ↑11 - ↑7 + ↑5 = 0 ⊢ ↑13 - ↑11 - ↑7 + ↑5 = 0] ⊢ ↑13 - ↑11 - ↑7 + ↑5 = 0
norm_num All goals completed! 🐙
@[category test, AMS 11]
theorem a_3 : a 3 = 0 := by ⊢ a 3 = 0
dsimp [a] ⊢ ↑(nth Nat.Prime 7) - ↑(nth Nat.Prime 6) - ↑(nth Nat.Prime 5) + ↑(nth Nat.Prime 4) = 0
rw [nth_prime_seven, ⊢ ↑19 - ↑(nth Nat.Prime 6) - ↑(nth Nat.Prime 5) + ↑(nth Nat.Prime 4) = 0 ⊢ ↑19 - ↑17 - ↑13 + ↑11 = 0 nth_prime_six, ⊢ ↑19 - ↑17 - ↑(nth Nat.Prime 5) + ↑(nth Nat.Prime 4) = 0 ⊢ ↑19 - ↑17 - ↑13 + ↑11 = 0 nth_prime_five, ⊢ ↑19 - ↑17 - ↑13 + ↑(nth Nat.Prime 4) = 0 ⊢ ↑19 - ↑17 - ↑13 + ↑11 = 0 Nat.nth_prime_four_eq_eleven ⊢ ↑19 - ↑17 - ↑13 + ↑11 = 0 ⊢ ↑19 - ↑17 - ↑13 + ↑11 = 0] ⊢ ↑19 - ↑17 - ↑13 + ↑11 = 0
norm_num All goals completed! 🐙
@[category test, AMS 11]
theorem a_4 : a 4 = 4 := by ⊢ a 4 = 4
dsimp [a] ⊢ ↑(nth Nat.Prime 9) - ↑(nth Nat.Prime 8) - ↑(nth Nat.Prime 7) + ↑(nth Nat.Prime 6) = 4
rw [nth_prime_nine, ⊢ ↑29 - ↑(nth Nat.Prime 8) - ↑(nth Nat.Prime 7) + ↑(nth Nat.Prime 6) = 4 ⊢ ↑29 - ↑23 - ↑19 + ↑17 = 4 nth_prime_eight, ⊢ ↑29 - ↑23 - ↑(nth Nat.Prime 7) + ↑(nth Nat.Prime 6) = 4 ⊢ ↑29 - ↑23 - ↑19 + ↑17 = 4 nth_prime_seven, ⊢ ↑29 - ↑23 - ↑19 + ↑(nth Nat.Prime 6) = 4 ⊢ ↑29 - ↑23 - ↑19 + ↑17 = 4 nth_prime_six ⊢ ↑29 - ↑23 - ↑19 + ↑17 = 4 ⊢ ↑29 - ↑23 - ↑19 + ↑17 = 4] ⊢ ↑29 - ↑23 - ↑19 + ↑17 = 4
norm_num All goals completed! 🐙Do the absolute values cover A004275? A004275 is $1$ together with the nonnegative even numbers. The conjecture asks whether every member of A004275 occurs as $|a(n)|$ for some term of the sequence.
@[category research open, AMS 11]
theorem conjecture :
∀ d : ℕ, (d = 1 ∨ Even d) → ∃ n > 0, d = (a n).natAbs := by ⊢ ∀ (d : ℕ), d = 1 ∨ Even d → ∃ n > 0, d = (OeisA110854.a n).natAbs
sorry All goals completed! 🐙end OeisA110854