The Frobenius number for sequences of triangular and tetrahedral numbers - ScienceDirect
Skip to main contentSkip to article Elsevier logo Journals & Books Search RegisterSign in …

The Frobenius number $ g (S) $ of a set $ S $ of non-negative integers with $\gcd 1$ is the
largest integer not expressible as a linear combination of elements of $ S $. Given a …

We investigate numerical semigroups generated by any quadratic sequence with initial term
zero and an infinite number of terms. We find an efficient algorithm for calculating the Apéry …

Sn, k=〈 xn+j=(n+ j) k| j∈ N〉=⟨ nk,(n+ 1) k,(n+ 2) k,...⟩ defined for all integers n≥ 1, where
k≥ 1 is a fixed integer. We prove that the embedding dimension e (Sn, 2) has linear …

We present a general method for computing the abelian complexity ρab s of an automatic
sequence s, provided that (a) the Parikh vectors of the length-n prefixes of s form a …