A complete categorization of when generalized Tribonacci sequences can be avoided by additive partitions
Let \(C\) be a set of positive integers. \(C\) is said to be avoidable if there is a partition of \(\mathbb{N}\) into two parts \(A\) and \(B\) such that \(A+B\cap C=\emptyset\), where \(A+B=\{a+b \mid a\in A\), \(b\in B\}.\) For example the Fibonacci sequence is avoidable as Alladi, Erdős and Hoggatt proved. Hoggatt, and later Dumitru, investigated the sequence with recursion \(s_n=s_{n-1}+s_{n-2}+s_{n-3}\) and special initial terms. In the present paper the author investigates the case when the initial terms are arbitrary. He establishes a finite set \(C\) showing that \(\{s_n\}\) is avoidable if and only if \(C\) is avoidable.
- On generalized Tribonacci sequences and additive partitions
- A class of generalized Tribonacci sequences applied to counting problems
- scientific article; zbMATH DE number 3847465
- The generalized Tribonacci p-numbers and applications
- On generalization for Tribonacci trigintaduonions
- Variations on a generating-function theme: enumerating compositions with parts avoiding an arithmetic sequence
- On Generalized Tribonacci Sedenions
- scientific article; zbMATH DE number 3252393
- scientific article; zbMATH DE number 1998293
- scientific article; zbMATH DE number 2241925
- Continued fractions and unique additive partitions
- On generalized Tribonacci sequences and additive partitions
- A class of generalized Tribonacci sequences applied to counting problems
- Counting the number of unavoidable sets of a given size in a finite set of integers
- scientific article; zbMATH DE number 5542629 (Why is no real title available?)
- A class of \(S\)-restricted compositions
This page was built for publication: A complete categorization of when generalized Tribonacci sequences can be avoided by additive partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1585654)
