Related papers: A remarkable sequence related to $\pi$ and $\sqrt{…
Let $\beta$ be a non-unit real algebraic integer greater than one and $\{a_{n}\}_{n \geq 0}$ be a sequence satisfying a linear recurrence relation $a_{n+3}=aa_{n+2}+ba_{n+1}+ca_{n}$. Under certain conditions, we prove that the number of…
Examples of algebraic surfaces of general type with maximal Picard number are not abundant in the literature. Moreover, most known examples either possess low invariants, lie near the Noether line $K^2=2\chi-6$ or are somewhat scattered. A…
We consider the well-studied pattern counting problem: given a permutation $\pi \in \mathbb{S}_n$ and an integer $k > 1$, count the number of order-isomorphic occurrences of every pattern $\tau \in \mathbb{S}_k$ in $\pi$. Our first result…
The classical Fibonacci sequence is known to exhibit many fascinating properties. In this paper, we explore the Fibonacci sequence and integer sequences generated by second order linear recurrence relations with positive integer…
We discuss an equivalence relation on the set of square binary matrices with the same number of 1's in each row and each column. Each binary matrix is represented using ordered n-tuples of natural numbers. We give a few starting values of…
We deduce several curious q-series expansions by applying inverse relations to certain identities for basic hypergeometric series. After rewriting some of these expansions in terms of q-integrals, we obtain, in the limit q -> 1, some…
Let $D^+$ be the first octant of the Euclidean space and consider the integral cube grid $G$ in $D^+$. The intersections of each line with $G$ form an infinite sequence of three letters which can be considered as an extension of well-known…
We study the integer sequence v_n of numbers of lines in hypersurfaces of degree 2n-3 of P^n, n>1. We prove a number of congruence properties of these numbers of several different types. Furthermore, the asymptotics of the v_n are described…
We use the classical definitions (i) $\pi$ is the ratio of area to the square of the radius of a circle; (ii) $\pi$ is the ratio of circumference to the diameter of a circle, to prove $\pi$'s existence within the purview of Euclidean…
This note considers linear recurrences (also called linear difference equations) in unknowns indexed by the integers. We characterize a unique \emph{reduced} linear recurrence with the same solutions as a given linear recurrence, and…
We joke about how to compute (promptly) the digits of $\pi$, in base 5, from a given place without computing preceding ones.
Recently there is huge interest in graph theory and intensive study on computing integer powers of matrices. In this paper, we investigate relationships between one type of graph and well-known Fibonacci sequence. In this content, we…
We study the entropy $S$ of longest increasing subsequences (LIS), i.e., the logarithm of the number of distinct LIS. We consider two ensembles of sequences, namely random permutations of integers and sequences drawn i.i.d.\ from a limited…
The following article summarizes research where theorems and their respective demonstrations are postulated based on quadratic equations with special properties given by the Pythagorean triplets and the Fibonacci sequence given the second…
For a polynomial P, we consider the sequence of iterated integrals of ln P(x). This sequence is expressed in terms of the zeros of P(x). In the special case of ln(1 + x^2), arithmetic properties of certain coefficients arising are…
We introduce numbers depending on three parameters which we call skyscraper numbers. We discuss properties of these numbers and their relationship with Stirling numbers of the first kind, and we also introduce a skyscraper sequence.
We show that sequences of positive integers whose ratios $a_n^2/a_{n+1}$ lie within a specific range are almost uniquely determined by their reciprocal sums. For instance, the Sylvester sequence is uniquely characterized as the only…
On the set of positive integers, we consider the iterative process that maps $n$ to either $\frac{3n+1}{2}$ or $\frac{n}{2}$ depending on the parity of $n$. The Collatz conjecture states that all such sequences eventually enter the trivial…
We have exhaustively enumerated all simple, connected graphs of a finite order and have computed a selection of invariants over this set. Integer sequences were constructed from these invariants and checked against the Online Encyclopedia…
This note provides very simple, efficient algorithms for computing the number of distinct longest common subsequences of two input strings and for computing the number of LCS embeddings.