Related papers: Stuttering Conway Sequences Are Still Conway Seque…

If the list of binary numbers is read by upward-sloping diagonals, the resulting ``sloping binary numbers'' 0, 11, 110, 101, 100, 1111, 1010, ... (or 0, 3, 6, 5, 4, 15, 10, ...) have some surprising properties. We give formulae for the n-th…

We study the problem of generating interesting integer sequences with a combinatorial interpretation. For this we introduce a two-step approach. In the first step, we generate first-order logic sentences which define some combinatorial…

I propose and investigate the use of continuous functional equations for the study of meta-Fibonacci integer sequences. This exploratory study includes three sequences with quite different behavior: Conway's famous sequence $A(n)=…

The Collatz sequence for a given natural number $N$ is generated by repeatedly applying the map $N$ $\rightarrow$ $3N+1$ if $N$ is odd and $N$ $\rightarrow$ $N/2$ if $N$ is even. One elusive open problem in Mathematics is whether all such…

In this note, we show the existence of integer sequences of lengths at least 3 (except 7) such that for every integer in position $i\equiv 1\pmod{4}$ (respectively position $j\equiv 3\pmod{4}$), counting from left to right, the sum of the…

This article is meant to provide an additional point of view, applying known knowledge, to supply keys that have a series of non-repeating digits, in a manner that is not usually thought of. Traditionally, prime numbers are used in…

A nondecreasing sequence of positive integers is $(\alpha,\beta)$-Conolly, or Conolly-like for short, if for every positive integer $m$ the number of times that $m$ occurs in the sequence is $\alpha + \beta r_m$, where $r_m$ is $1$ plus the…

We show that the sequence of moments of order less than 1 of averages of i.i.d. positive random variables is log-concave. For moments of order at least 1, we conjecture that the sequence is log-convex and show that this holds eventually for…

This article is meant to provide an additional point of view, applying known knowledge, to supply keys that have a series of non-repeating digits, in a manner that is not usually thought of. Traditionally, prime numbers are used in…

We prove an existing conjecture that the sequence defined recursively by $a_1=1, a_2=2, a_n=4a_{n-1}-2a_{n-2}$ counts the number of length-$n$ permutations avoiding the four generalized permutation patterns 1-32-4, 1-42-3, 2-31-4, and…

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 study log-concavity properties of real sequences $(a_n)_{n \ge 0}$ satisfying a $d$-th order linear recurrence whose coefficients are linear functions of $n$; the so-called P-recursive (or holonomic) sequences. Writing the recurrence in…

The Collatz conjecture, which posits that any positive integer will eventually reach 1 through a specific iterative process, is a classic unsolved problem in mathematics. This research focuses on designing an efficient algorithm to compute…

In this paper 101 new integer sequences, sub-sequences, and sequences of sequences, together with related unsolved problems and conjectures, are presented. Also, definitions, examples, solved or open questions, and references for each…

Motivated by computing duplication patterns in sequences, a new fundamental problem called the longest subsequence-repeated subsequence (LSRS) is proposed. Given a sequence $S$ of length $n$, a letter-repeated subsequence is a subsequence…

We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…

This paper is devoted to the study of the log-convexity of combinatorial sequences. We show that the log-convexity is preserved under componentwise sum, under binomial convolution, and by the linear transformations given by the matrices of…

Conway and Doyle have claimed to be able to divide by three. We attempt to replicate their achievement and fail. In the process, we get tangled up in some shoes and socks and forget how to multiply.

The frog model is a growing system of random walks where a particle is added whenever a new site is visited. A longstanding open question is how often the root is visited on the infinite $d$-ary tree. We prove the model undergoes a phase…

An Inventory Sequence $(S_0, S_1, S_2, ...)$ is the iteration of the map $f$ defined roughly by taking an integer to its numericized description (e.g. $f(1381)=211318$ since "$1381$" has two $1$'s, one $3$, and one $8$). Our work analyzes…