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

Odd part of the digital sum of $3^n$ divided by the maximal power of $3$

The sequence $a(n)$ is the odd part of the base-$10$ digital sum of $3^n$ divided by the maximal possible power of $3$.

References:

@[expose] public sectionnamespace OeisA250131open Nat

The odd part of the digital sum of $3^n$ divided by the maximal possible power of $3$.

def a (n : ℕ) : ℕ := let d := (Nat.digits 10 (3 ^ n)).sum let v3 := padicValNat 3 d let v2 := padicValNat 2 d d / (3 ^ v3 * 2 ^ v2)@[category test, AMS 11] theorem a_1 : a 1 = 1 := ⊢ a 1 = 1 All goals completed! 🐙@[category test, AMS 11] theorem a_2 : a 2 = 1 := ⊢ a 2 = 1 All goals completed! 🐙@[category test, AMS 11] theorem a_3 : a 3 = 1 := ⊢ a 3 = 1 All goals completed! 🐙@[category test, AMS 11] theorem a_4 : a 4 = 1 := ⊢ a 4 = 1 All goals completed! 🐙@[category test, AMS 11] theorem a_14 : a 14 = 5 := ⊢ a 14 = 5 All goals completed! 🐙

Auxiliary sequence $b(n)$ related to A250131: $b(1)=2$, $b(2)=3$, and $b(n)=a(n-2)$ for $n \ge 3$.

def b (n : ℕ) : ℕ := match n with | 0 => 0 | 1 => 2 | 2 => 3 | n' + 3 => a (n' + 1)

The set of indices $n \ge 1$ such that $b(n) \ne 1$ and $b(n)$ is not a multiple of any $b(k)$ for $1 \le k < n$ where $b(k) \ne 1$. This formalizes the Eratosthenes-like sieve applied to $b(n)$ after removing $1$s.

def sievedIndices : Set ℕ := { n | 1 ≤ n ∧ b n ≠ 1 ∧ ∀ k, (1 ≤ k ∧ k < n ∧ b k ≠ 1) → ¬ (b k ∣ b n) }

Conjecture: Consider the sequence $b(n)$ such that $b(1)=2$, $b(2)=3$, and for $n \ge 3$, $b(n)=a(n-2)$. If we apply the Eratosthenes-like sieve to $b(n)$ and remove $1$s, then we obtain a sequence of primes.

    Vladimir Shevelev, Dec 12 2014

@[category research open, AMS 11] theorem conjecture_1 : ∀ n ∈ sievedIndices, (b n).Prime := ⊢ ∀ n ∈ sievedIndices, Nat.Prime (b n) All goals completed! 🐙

Stronger variant: the sieved sequence $b(n)$ yields the set of all primes (in some perturbed order).

Note: This stronger statement is not explicitly written on the A250131 OEIS page (which only states conjecture_1 and notes via Peter J. C. Moses that "these primes follow with some perturbation of order"), but is implied by prepending $b(1)=2, b(2)=3$ (which otherwise have no effect on the sieve since $\gcd(a(n), 6) = 1$) and by Vladimir Shevelev's analogous conjecture in the cross-referenced entries A221858 and A225039.

@[category research open, AMS 11] theorem conjecture_2 : b '' sievedIndices = {p : ℕ | p.Prime} := ⊢ b '' sievedIndices = {p | Nat.Prime p} All goals completed! 🐙end OeisA250131