We consider a new family $(\mathcal {T}_n)_{n\geq 1}$ of aperiodic sets of Wang tiles and we describe the dynamical properties of the set $\Omega _n$ of valid configurations $\mathbb {Z}^2\to \mathcal {T}_n$. The tiles can be defined as the different instances of a square-shaped computer chip whose inputs and outputs are 3-dimensional integer vectors. The family include the Ammann aperiodic set of 16 Wang tiles and gathers the hallmarks of other small aperiodic sets of Wang tiles. Notably, the tiles satisfy additive versions of equations verified by the Kari–Culik aperiodic sets of 14 and 13 Wang tiles. Also configurations in $\Omega _n$ are the codings of a $\mathbb {Z}^2$-action on a 2-dimensional torus like the Jeandel–Rao aperiodic set of 11 Wang tiles. The family broadens the relation between quadratic integers and aperiodic tilings beyond the omnipresent golden ratio as the dynamics of $\Omega _n$ involves the positive root $\beta $ of the polynomial $x^2-nx-1$, also known as the n-th metallic mean. We show the existence of an almost one-to-one factor map $\Omega _n\to \mathbb {T}^2$ which commutes the shift action on $\Omega _n$ with horizontal and vertical translations by $\beta $ on $\mathbb {T}^2$. The factor map can be explicitly defined by the average of the top labels from the same row of tiles as in Kari and Culik examples. The proofs are based on the minimality of $\Omega _n$ (proved in a previous article) and a polygonal partition of $\mathbb {T}^2$ which we show is a Markov partition for the toral $\mathbb {Z}^2$-action. The partition and the sets of Wang tiles are symmetric which makes them, like Penrose tilings, worthy of investigation.

For every positive integer n, we introduce a set ${\mathcal {T}}_n$ made of $(n+3)^2$ Wang tiles (unit squares with labeled edges). We represent a tiling by translates of these tiles as a configuration $\mathbb {Z}^2\to {\mathcal {T}}_n$. A configuration is valid if the common edge of adjacent tiles has the same label. For every $n\geq 1$, we show that the Wang shift ${\Omega }_n$, defined as the set of valid configurations over the tiles ${\mathcal {T}}_n$, is self-similar, aperiodic and minimal for the shift action. We say that $\{{\Omega }_n\}_{n\geq 1}$ is a family of metallic mean Wang shifts, since the inflation factor of the self-similarity of $\Omega _n$ is the positive root of the polynomial $x^2-nx-1$. This root is sometimes called the n-th metallic mean, and in particular, the golden mean when $n=1$, and the silver mean when $n=2$. When $n=1$, the set of Wang tiles ${\mathcal {T}}_1$ is equivalent to the Ammann aperiodic set of 16 Wang tiles.

For an integer $k \geq 2$, let $P_{n}^{(k)}$ be the k-generalised Pell sequence, which starts with $0, \ldots ,0,1$ (k terms), and each term thereafter is given by the recurrence $P_{n}^{(k)} = 2 P_{n-1}^{(k)} +P_{n-2}^{(k)} +\cdots +P_{n-k}^{(k)}$. We search for perfect powers, which are sums or differences of two k-generalised Pell numbers.

We determine the characteristic polynomials of the matrices $[q^{\,j-k}+t]_{1\le \,j,k\le n}$ and $[q^{\,j+k}+t]_{1\le \,j,k\le n}$ for any complex number $q\not =0,1$. As an application, for complex numbers $a,b,c$ with $b\not =0$ and $a^2\not =4b$, and the sequence $(w_m)_{m\in \mathbb Z}$ with $w_{m+1}=aw_m-bw_{m-1}$ for all $m\in \mathbb Z$, we determine the exact value of $\det [w_{\,j-k}+c\delta _{jk}]_{1\le \,j,k\le n}$.

A generalisation of the well-known Pell sequence $\{P_n\}_{n\ge 0}$ given by $P_0=0$, $P_1=1$ and $P_{n+2}=2P_{n+1}+P_n$ for all $n\ge 0$ is the k-generalised Pell sequence $\{P^{(k)}_n\}_{n\ge -(k-2)}$ whose first k terms are $0,\ldots ,0,1$ and each term afterwards is given by the linear recurrence $P^{(k)}_n=2P^{(k)}_{n-1}+P^{(k)}_{n-2}+\cdots +P^{(k)}_{n-k}$. For the Pell sequence, the formula $P^2_n+P^2_{n+1}=P_{2n+1}$ holds for all $n\ge 0$. In this paper, we prove that the Diophantine equation

$$ \begin{align*} (P^{(k)}_n)^2+(P^{(k)}_{n+1})^2=P^{(k)}_m \end{align*} $$

has no solution in positive integers $k, m$ and n with $n>1$ and $k\ge 3$.

Let a and b be positive integers and let $\{U_n\}_{n\ge 0}$ be the Lucas sequence of the first kind defined by

$$ \begin{align*}U_0=0,\quad U_1=1\quad \mbox{and} \quad U_n=aU_{n-1}+bU_{n-2} \quad \mbox{for }n\ge 2.\end{align*} $$

We define an $(a,b)$-Wall–Sun–Sun prime to be a prime p such that $\gcd (p,b)=1$ and $\pi (p^2)=\pi (p),$ where $\pi (p):=\pi _{(a,b)}(p)$ is the length of the period of $\{U_n\}_{n\ge 0}$ modulo p. When $(a,b)=(1,1)$, such primes are known in the literature simply as Wall–Sun–Sun primes. In this note, we provide necessary and sufficient conditions such that a prime p dividing $a^2+4b$ is an $(a,b)$-Wall–Sun–Sun prime.

We discuss near-perfect numbers of various forms. In particular, we study the existence of near-perfect numbers in the Fibonacci and Lucas sequences, near-perfect values taken by integer polynomials and repdigit near-perfect numbers.

Let $\mathcal {A}$ be the set of all integers of the form $\gcd (n, F_n)$, where n is a positive integer and $F_n$ denotes the nth Fibonacci number. Leonetti and Sanna proved that $\mathcal {A}$ has natural density equal to zero, and asked for a more precise upper bound. We prove that

$$ \begin{align*} \#\big(\mathcal{A} \cap [1, x]\big) \ll \frac{x \log \log \log x}{\log \log x} \end{align*} $$

By combining the generating function approach with the Lagrange expansion formula, we evaluate, in closed form, two multiple alternating sums of binomial coefficients, which can be regarded as alternating counterparts of the circular sum evaluation discovered by Carlitz [‘The characteristic polynomial of a certain matrix of binomial coefficients’, Fibonacci Quart. 3(2) (1965), 81–89].

We show that the $Kn$–smooth part of $a^n-1$ for an integer $a>1$ is $a^{o(n)}$ for most positive integers n.

In this paper, for a positive integer n ≥ 1, we look at the size and prime factors of the iterates of the Ramanujan τ function applied to n.

Let $F$ be an integral linear recurrence, $G$ an integer-valued polynomial splitting over the rationals and $h$ a positive integer. Also, let ${\mathcal{A}}_{F,G,h}$ be the set of all natural numbers $n$ such that $\gcd (F(n),G(n))=h$. We prove that ${\mathcal{A}}_{F,G,h}$ has a natural density. Moreover, assuming that $F$ is nondegenerate and $G$ has no fixed divisors, we show that the density of ${\mathcal{A}}_{F,G,1}$ is 0 if and only if ${\mathcal{A}}_{F,G,1}$ is finite.

Assuming Lang's conjectured lower bound on the heights of non-torsion points on an elliptic curve, we show that there exists an absolute constant $C$ such that for any elliptic curve $E/\mathbb{Q}$ and non-torsion point $P\,\in \,E\left( \mathbb{Q} \right)$ , there is at most one integral multiple $\left[ n \right]P$ such that $n\,>\,C$ . The proof is a modification of a proof of Ingram giving an unconditional, but not uniform, bound. The new ingredient is a collection of explicit formulæ for the sequence $v\left( {{\Psi }_{n}} \right)$ of valuations of the division polynomials. For $P$ of non-singular reduction, such sequences are already well described in most cases, but for $P$ of singular reduction, we are led to define a new class of sequences called elliptic troublemaker sequences, which measure the failure of the Néron local height to be quadratic. As a corollary in the spirit of a conjecture of Lang and Hall, we obtain a uniform upper bound on $\widehat{h}\left( P \right)/h\left( E \right)$ for integer points having two large integral multiples.

This paper considers algebraic independence and hypertranscendence of functions satisfying Mahler-type functional equations $af(z^{r})=f(z)+R(z)$ , where $a$ is a nonzero complex number, $r$ an integer greater than 1, and $R(z)$ a rational function. Well-known results from the scope of Mahler’s method then imply algebraic independence over the rationals of the values of these functions at algebraic points. As an application, algebraic independence results on reciprocal sums of Fibonacci and Lucas numbers are obtained.

We prove that for each positive integer k in the range 2≤k≤10 and for each positive integer k≡79 (mod 120) there is a k-step Fibonacci-like sequence of composite numbers and give some examples of such sequences. This is a natural extension of a result of Graham for the Fibonacci-like sequence.

Following up on a paper of Balamohan et al. [‘On the behavior of a variant of Hofstadter’s $q$-sequence’, J. Integer Seq. 10 (2007)], we analyze a variant of Hofstadter’s $Q$-sequence and show that its frequency sequence is 2-automatic. An automaton computing the sequence is explicitly given.

We prove the holomorphic continuation of certain multi-variable multiple zeta-functions whose coefficients satisfy a suitable recurrence condition. In fact, we introduce more general vectorial zeta-functions and prove their holomorphic continuation. Moreover, we show a vectorial sum formula among those vectorial zeta-functions from which some generalizations of the classical sum formula can be deduced.