Related papers: How does the Gerrymander Sequence Continue?
Recently Kauers, Koutschan and Spahn announced a significant increase in the length of the so-called {\em gerrymander sequence}, given as A348456 in the OEIS, extending the sequence from 3 terms to 7 terms. We give a further extension to 11…
Given finitely many consecutive terms of an infinite sequence, we discuss the construction of a polynomial difference equation that the sequence may satisfy. We also present a method to seek a candidate polynomial differential equation for…
Number sequences defined by a linear recursion relation are studied by means of generating functions. Indices of the terms in the recursion relation have arbitrary differenses. In addition to formulas for the nth term an algorithm is…
In this work we resolve several conjectures stated in the On-Line Encyclopedia of Integer sequences.
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…
We continue the work begun in OEIS sequence A332636 which presents recursive sequences that have triangles that appear embedded in them. This paper i) generalizes the main result presented in A332636, ii) provides a complete set of…
In this expository article we collect the integer sequences that count several different types of matrices over finite fields and provide references to the Online Encyclopedia of Integer Sequences (OEIS). Section 1 contains the sequences,…
We describe a simple method that produces automatically closed forms for the coefficients of continued fractions expansions of a large number of special functions. The function is specified by a non-linear differential equation and initial…
Sequences are often conveniently encoded in the form of a generating function depending on a formal variable. This note presents two observations that allow one to draw conclusions about the generated sequence from the generating function.…
In this work, we present a series of bijections that reveal the deep connections between the concepts of tree records, the girth of a connected endofunction, and the genesis sequence, the first sequence in the OEIS. We use these results to…
$a_n=[x^n](1-x)^{-n}(1-x^2)^{-n}$ is the sequence A348410 in the Encyclopedia of Integer Sequences. Using a method from Hautus and Klarner from 1971 and the software \textsf{Gfun} we find an algebraic equation for the generating function…
Sequence A000975 in the Online Encyclopedia of Integer Sequences (OEIS) starts out 1, 2, 5, 10, 21, 42, 85, ... . As of July 1, 2016, the description in the OEIS lists several characterizations of this sequence and numerous examples of…
In an automatic search, we found conjectural recurrences for some sequences in the OEIS that were not previously recognized as being D-finite. In some cases, we are able to prove the conjectured recurrence. In some cases, we are not able to…
Recently Raayoni et al. announced various conjectures on continued fractions of fundamental constants automatically generated with machine learning techniques. In this paper we prove some of their stated conjectures for Euler number $e$ and…
If you want to fill $n \in \mathbb{N}$ seats in succession with $n$ people and the rule that each person chooses one of the seats with the maximum distance to an occupied seat, then you can ask yourself how many possibilities there are for…
First we define a new kind of function over $\mathbb{N}$. For each $i\in\mathbb{N}$ we have an associated function, which will be called $S_i$ . Then we define a new kind of sequence, to be made from the functions $S_i$ . Finally, we will…
We find an explicit formula for the generating function for the squaring the terms of an $\ell^{th}$ order linear recurrence.
Sequences whose terms are equal to the number of functions with specified properties are considered. Properties are based on the notion of derangements in a more general sense. Several sequences which generalize the standard notion of…
We give a combinatorial interpretation in terms of bicolored ordered trees for the sequence (a_n)_{n>=1}=(1, 1, 1, 2, 3, 6, 10, 20, 36, 73,... ), A345973 in OEIS, whose generating function satisfies the defining identity Sum_{n>=1}a_n x^n =…
A new method for continuing the usual Dirichlet series that defines the Riemann zeta function ${\zeta}(s)$ is presented. Numerical experiments demonstrating the computational efficacy of the resulting continuation are discussed.