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

Ways to write $n = k + m$ with $p_k^2 - 2$, $p_m^2 - 2$, and $p_{p_m}^2 - 2$ all prime

Let $p_j$ denote the $j$-th prime number. The sequence $a(n)$ counts the number of ways to write $n = k + m$ with $k > 0$ and $m > 0$ such that $p_k^2 - 2$, $p_m^2 - 2$, and $p_{p_m}^2 - 2$ are all prime.

References:

@[expose] public sectionnamespace OeisA237413

$a(n)$ is the number of ways to write $n = k + m$ with $k > 0$ and $m > 0$ such that $p_k^2 - 2$, $p_m^2 - 2$, and $p_{p_m}^2 - 2$ are all prime.

noncomputable def a (n : ℕ) : ℕ := ∑ k ∈ Finset.Ico 1 n, if (Nat.nth Nat.Prime (k - 1) ^ 2 - 2).Prime ∧ (Nat.nth Nat.Prime (n - k - 1) ^ 2 - 2).Prime ∧ (Nat.nth Nat.Prime (Nat.nth Nat.Prime (n - k - 1) - 1) ^ 2 - 2).Prime then 1 else 0@[category test, AMS 11] theorem a_1 : a 1 = 0 := ⊢ a 1 = 0 All goals completed! 🐙h:Finset.Ico 1 2 = {1}⊢ a 2 = 1 h:Finset.Ico 1 2 = {1}⊢ (if Nat.Prime (2 ^ 2 - 2) ∧ Nat.Prime (2 ^ 2 - 2) ∧ Nat.Prime (3 ^ 2 - 2) then 1 else 0) = 1 All goals completed! 🐙h:Finset.Ico 1 3 = {1, 2}⊢ a 3 = 2 h:Finset.Ico 1 3 = {1, 2}⊢ ((if Nat.Prime (2 ^ 2 - 2) ∧ Nat.Prime (3 ^ 2 - 2) ∧ Nat.Prime (5 ^ 2 - 2) then 1 else 0) + if Nat.Prime (3 ^ 2 - 2) ∧ Nat.Prime (2 ^ 2 - 2) ∧ Nat.Prime (3 ^ 2 - 2) then 1 else 0) = 2 All goals completed! 🐙h:Finset.Ico 1 4 = {1, 2, 3}⊢ a 4 = 2 h:Finset.Ico 1 4 = {1, 2, 3}⊢ (if Nat.Prime (2 ^ 2 - 2) ∧ Nat.Prime (5 ^ 2 - 2) ∧ Nat.Prime (11 ^ 2 - 2) then 1 else 0) + ((if Nat.Prime (3 ^ 2 - 2) ∧ Nat.Prime (3 ^ 2 - 2) ∧ Nat.Prime (5 ^ 2 - 2) then 1 else 0) + if Nat.Prime (5 ^ 2 - 2) ∧ Nat.Prime (2 ^ 2 - 2) ∧ Nat.Prime (3 ^ 2 - 2) then 1 else 0) = 2 All goals completed! 🐙h:Finset.Ico 1 5 = {1, 2, 3, 4}⊢ a 5 = 2 h:Finset.Ico 1 5 = {1, 2, 3, 4}⊢ (if Nat.Prime (2 ^ 2 - 2) ∧ Nat.Prime (7 ^ 2 - 2) ∧ Nat.Prime (17 ^ 2 - 2) then 1 else 0) + ((if Nat.Prime (3 ^ 2 - 2) ∧ Nat.Prime (5 ^ 2 - 2) ∧ Nat.Prime (11 ^ 2 - 2) then 1 else 0) + ((if Nat.Prime (5 ^ 2 - 2) ∧ Nat.Prime (3 ^ 2 - 2) ∧ Nat.Prime (5 ^ 2 - 2) then 1 else 0) + if Nat.Prime (7 ^ 2 - 2) ∧ Nat.Prime (2 ^ 2 - 2) ∧ Nat.Prime (3 ^ 2 - 2) then 1 else 0)) = 2 All goals completed! 🐙

Conjecture: $a(n) > 0$ for all $n > 1$.

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