/-
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.
-/modulepublicimportFormalConjecturesUtil
The primary defining sequence a.
$a(n)$ is defined by the recurrence relation $a(n) = 3 a(n-1) + a(n-2) - 3 a(n-3)$
with initial terms $a(0)=1, a(1)=3, a(2)=5$.
The current sequence contains primes, including $3, 5, 41, 21523361$.
Is there an $(a, b, c)$ weighted tribonacci sequence with $a, b, c$ relatively prime
which is prime-free?
Yes: take $(a, b, c) = (1, 1, -1)$ and the constant sequence $x(n) = 4$.
The linked Lean proof is by Kenta Kitamura.