Skip to main content

Questions tagged [integer-sequences]

For questions about sequences of integers. References are often made to the online resource oeis.org.

Filter by
Sorted by
Tagged with
11 votes
1 answer
864 views

Up to $10^6$: $\sigma(8n+1) \mod 4 = OEIS A001935(n) \mod 4$ (Number of partitions with no even part repeated )

Up to $10^6$: $\sigma(8n+1) \mod 4 = OEIS A001935(n) \mod 4$ A001935 Number of partitions with no even part repeated Is this true in general? It would mean relation between restricted partitions ...
joro's user avatar
  • 25.4k
11 votes
3 answers
684 views

Series and sequences in physical systems & closed form expressions

I gave a colloquium a while ago about physics inspiring recent developments in mathematics and as is almost borderline cliche in such talks, I mentioned the Fibonacci sequence with closed form ...
11 votes
1 answer
2k views

Biased random Fibonacci sequences

I have recently been toying (very superficially) with the random Fibonacci sequence, i.e., defined by $F_0=1=F_1=1$ and $$ F_{n} = F_{n-1} + \varepsilon_n F_{n-2} $$ where $(\varepsilon_n)_{n\geq 2}$ ...
Clement C.'s user avatar
  • 1,372
10 votes
2 answers
1k views

Consecutive numbers with mutually distinct exponents in their canonical prime factorization

Is it possible to find 23 consecutive positive integers each of which has mutually distinct exponents in its canonical prime factorization? Such numbers are sequence A130091 in OEIS. 24 such numbers ...
Bernardo Recamán Santos's user avatar
10 votes
1 answer
589 views

XOR-free sets: Maximum density?

It is known that sum-free subsets of $\mathbb{N}$ can have natural density at most $\frac{1}{2}$. This density is achieved by the odd numbers: the sum of two odd numbers is even. I ask now a similar ...
Joseph O'Rourke's user avatar
10 votes
2 answers
735 views

A number sequence problem involving binomial transform

Let $\{b_n\}_{n\geq0}$ be a sequence such that $b_nb_{n+1}=0$ and define $$a_n:=\sum_{k=0}^n(-1)^{n-k}\binom{n}{k}b_k.$$ If $\lim_{n\to\infty}a_n=0$, can we conclude that $b_n=0$ for all $n$? More ...
Ren Guan's user avatar
  • 111
10 votes
0 answers
252 views

Permutation of positive integers

Let $a_n$ be a sequence such that $a_1=1$ and for each $n \geq 1$ $a_{n+1}$ is the smallest positive integer distinct from $a_1,a_2,...,a_n$ such that $\gcd(a_{n+1}a_n+1,a_i)=1$ for each $i=1,2,...,n$....
jack's user avatar
  • 3,153
9 votes
2 answers
546 views

Can you tie up these Laurent sequences?

Fix an integer $k\geq3$. Define the two families of sequences $\{x_n\}$ and $\{y_n\}$ according to the rules: $$x_n=\frac{x_{n-1}^2+x_{n-2}^2+\cdots+x_{n-k+1}^2}{x_{n-k}} \qquad n\geq k$$ and $$y_n=\...
T. Amdeberhan's user avatar
9 votes
2 answers
1k views

The p-adic valuation of a linear recurrence

Let $(u_n)_{n \geq 0}$ be an integer-valued linear recurrence of order $k \geq 1$. Precisely, $$u_n = a_1 u_{n-1} + \cdots + a_k u_{n - k} \quad \forall n \geq k ,$$ for some $a_1, \ldots, a_k \in \...
user avatar
9 votes
0 answers
304 views

Symmetric function transition matrix and a non-conjecture by Clifford and Stanley

Consider the transition matrix $R = \left(R_{\lambda,\mu}\right)$, defined by $$ p_\lambda = \sum_{\mu} R_{\lambda\mu}m_\mu , $$ between the power-sum and the monomial basis of the ring of symmetric ...
Per Alexandersson's user avatar
9 votes
0 answers
398 views

When do almost all these invariants of tensors vanish?

Let $A,B,C,D$ be $n$-dimensional vector spaces over a field $k$. There is a natural homomorphism from the $mn^m$th tensor power $A^{\otimes (m n^m)} $ of $A$ to $k$ given by the determinant map $A^{\...
Will Sawin's user avatar
  • 149k
8 votes
4 answers
520 views

"Upside-down unimodal" sequences in combinatorics

Recall a sequence $a_0,\ldots,a_n$ of positive integers is unimodal if $a_0 \leq \cdots \leq a_m \geq \cdots \geq a_n$ for some $0 \leq m \leq n$. Unimodal integer sequences are abundant in ...
Sam Hopkins's user avatar
  • 24.2k
8 votes
1 answer
568 views

Arbitrarily many primes in a Fibonacci-type sequence

It is conjectured that the standard Fibonacci sequence contains infinitely many primes. While this is perhaps too difficult, I am wondering about the following simpler version: Question. For any $K$, ...
Xiaosheng Mu's user avatar
8 votes
1 answer
364 views

Is the permanent of the matrix $[(\frac{i+j}{2n+1})]_{0\le i,j\le n}$ always positive?

Recall that the permanent of an $n\times n$ matrix $A=[a_{i,j}]_{1\le i,j\le n}$ is defined by $$\operatorname{per}A=\sum_{\sigma\in S_n}\prod_{i=1}^n a_{i,\sigma(i)}.$$ In 2004, R. Chapman [Acta ...
Zhi-Wei Sun's user avatar
  • 15.6k
8 votes
4 answers
755 views

Upper bound on length of addition chain

An addition chain for $n$ is a finite sequence of integers starting at 1 and ending at $n$, such that each element is a sum of two previous elements. A short addition chain for $n$ can be used, for ...
Erel Segal-Halevi's user avatar
8 votes
1 answer
363 views

Possible small mistake in Bilu-Hanrot-Voutier paper on primitive divisors of Lehmer sequences (?)

I think that I might have spotted I small mistake (a missing $5$-defective Lehmer pair) in the classification of terms of Lehmer sequences without primitive divisors given in: 1 Bilu, Hanrot, and ...
Seee's user avatar
  • 65
8 votes
4 answers
1k views

A Pascal's-triangle -like random process

I was exploring Pascal's triangle on a cylinder when I encountered this puzzle-like problem. It is surely elementary, but perhaps weekend-entertaining. Start with a permutation of $(1,2,3, \ldots, n)$...
Joseph O'Rourke's user avatar
8 votes
0 answers
88 views

Generalization of Lucas sequences to order 3 (and above)

For fixed integer parameters $(P,Q)$, Lucas sequences represent a pair of complimentary integer sequences satisfying the same recurrence with the characteristic polynomial $f(x):=x^2 - Px + Q$. The ...
Max Alekseyev's user avatar
8 votes
0 answers
318 views

Why are these Littlewood-Richardson coefficients congruent to 1 mod 8?

Let $n\in{\mathbb N}$ and write $n=q_1+q_2+\dots+q_t$, where $q_1>q_2>\dots>q_t$ are powers of $2$. Let $\lambda_n$ be the partition with Frobenius symbol $(q_1-1,q_2-1,\dots,q_t-1;q_t,q_{t-1}...
John Murray's user avatar
  • 1,090
8 votes
0 answers
1k views

Is the Collatz conjecture known to be true for interesting unbounded classes of numbers?

The Collatz or the $3n+1$ conjecture is open. Is there a specific polynomial $f(x)\in\mathbb Z[x]$ whose range is unbounded for which every integer of form $|f(m)|$ at $m\in\mathbb Z$ satisfies $3n+1$...
Turbo's user avatar
  • 13.9k
8 votes
0 answers
237 views

Sequences for which $\prod (1-z^n)^{a(n)}$ is a polynomial

This is mostly a reference request. I'm working with complex coefficients, although all I have in mind have integer coefficients. Let $a=(a(n))_{n\ge 1}$ be a sequence, say of integers (I have non-...
YCor's user avatar
  • 63.9k
8 votes
0 answers
145 views

Minimum length of sequence such that every integer from 1 to n can be achieved as the sum of some contiguous subsequence

This question literally came to me in a fever dream last night, and it's frustrating me to no end. I'll try to explain it as best I can, but there may not be a satisfying answer; the best outcome ...
Joachim Worthington's user avatar
7 votes
4 answers
1k views

Find a formula for the recurrent sequence $q_{n+1}=q_n(q_n+1)+1$

Find an analytic formula for the recurrent sequence $$q_{n+1}=q_n(q_n+1)+1,\;\;q_0\in\mathbb N.$$ (The question was asked on 03.05.2018 by M. Pratsovytyi, see page 109 of Volume 1 of the Lviv ...
Lviv Scottish Book's user avatar
7 votes
2 answers
805 views

Distance among integer set

Given an integer set, if the distances between integers in the set are still in the set, what mathematical term should be used to describe that nature? Or what nature does the set have? For example, $...
hui cj's user avatar
  • 79
7 votes
2 answers
964 views

Maximal number of edges and triangular cells for n points in a triangular lattice

Consider a subset of $n$ points in an equilateral triangular lattice. Draw all the edges between nearest-neighbor points. What is the maximum, over all such subsets, of the number of edges? This ...
Keenan Pepper's user avatar
7 votes
2 answers
428 views

Limit associated with complementary sequences

Define $A=(a_n)$ and $B=(b_n)$ as follows: $a_0=1$, $a_1=2$, $b_0=3$, $b_1=4$, and $$a_n=a_0b_{n-1}+a_1b_{n-2}$$ for $n \geq 2$, where $A$ and $B$ are increasing and every positive integer occurs ...
Clark Kimberling's user avatar
7 votes
1 answer
527 views

Suitable closed form for the A079501

Let $a(n)$ be A079501 (i.e., number of compositions of the integer $n$ with strictly smallest part in the first position). The sequence begins with $$ 1, 1, 2, 2, 4, 5, 8, 12, 19, 28, 45, 70, 110, ...
Notamathematician's user avatar
7 votes
1 answer
386 views

Closed form expression for a recursion relation with binomial coefficients

I am interested in the following sequence: $$ T_n = \sum\limits^{n-1}_{k=0} \begin{pmatrix} n \\ k \end{pmatrix} T_{k}, \ \ \ \ T_0 = C \in \mathbb{N} $$ I would like to express it as a function of n, ...
Sharky's user avatar
  • 71
7 votes
1 answer
283 views

On one class of Somos-like sequences

This question is motivated by integrability of the sequence mistakenly arisen in the question Does this sequence always give an integer? Let $m_1,\ldots, m_{k-1}$ be positive integers and sequence $\{...
Alexey Ustinov's user avatar
7 votes
1 answer
455 views

More asymptotics for trees

This is a follow up to my recent question on the asymptotics of A003238. Lucia gave a fine answer to that question, but as I hinted the 'real' problem I have in mind is slightly different, and I've ...
Michael Albert's user avatar
7 votes
1 answer
286 views

On nontotient Fibonacci numbers

This question is related to sequence of numbers $t$ such that $F_{6t}$ is a nontotient where $F_n$ represents the sequence of Fibonacci numbers for $n\geq 0$. The online encyclopedia Wikipedia has the ...
Alkan's user avatar
  • 701
7 votes
1 answer
428 views

Counting hyperplane arrangements up to combinatorial equivalence, simple examples and history

Two arrangements of (affine) hyperplanes in $d$-dimensional Euclidean space are combinatorially isomorphic (or combinatorially equivalent) if they have isomorphic posets of faces. Counting the ...
Stefan Forcey's user avatar
7 votes
1 answer
125 views

Integer Recursion Reference Request

I've run across the following recursion which at times seems very steady and predictable and at other times seems very chaotic. Let $c_1, \dots c_k, b_0, m \in \mathbb{Z}$ with $b_0>m\ge 3$ and $...
Aeryk's user avatar
  • 2,235
7 votes
0 answers
184 views

Upper bounds for a sequence of integers

Given $\alpha\geq0$ we consider the sequence $$ C_k=k^\alpha\sum_{j=0}^{k-1}C_jC_{k-1-j} $$ with $C_0=1$. I'm interested in upper bounds (in terms of $\alpha$) for such a sequence. I know that when $\...
guacho's user avatar
  • 843
7 votes
0 answers
147 views

Factor-counting sequence

Define a non-negative integer sequence $\{\mathcal{F}_n\}$ as follows: start with 1 and, at each step, insert the number of entries already present in the sequence which are factors of the last one. ...
Alessandro Della Corte's user avatar
7 votes
0 answers
184 views

Some conjectural congruences involving Domb numbers

The Domb numbers are given by $$D_n=\sum_{k=0}^n\binom{n}{k}^2\binom{2k}k\binom{2(n-k)}{n-k}\ \ \ (n=0,1,2,\ldots).$$ Such numbers have combinatorial interpretation, see, e.g., http://oeis.org/A002895....
Zhi-Wei Sun's user avatar
  • 15.6k
7 votes
0 answers
210 views

My research paper involves computing additional terms of an existing OEIS sequence. Should I first amend the sequence or publish the results?

In the course of my research I computed terms of an existing OEIS sequence that are currently unknown. Having prepared my paper for publication, I am now faced with a (small) dilemma: Do I first ...
Klangen's user avatar
  • 1,962
7 votes
0 answers
280 views

A recursion which defines polynomials with integer coefficients?

Let $[n]=1+q+\dots+q^{n-1}$ and $u(n)=\prod_{j=1}^n \gcd([j],[n])$. Define $$r(n)=\sum_{d|n,d>1}{(-1)^d \frac{u(n)}{du(\frac{n}{d})^d}r\Big(\frac{n}{d}\Big)^d}+\frac{(1-q)^{n-1}u(n)}{n[n]}$$ with $...
Johann Cigler's user avatar
7 votes
0 answers
945 views

Intuition behind salient numbers in number of h-cobordism classes of smooth homotopy n-spheres

The Wikipedia article on Exotic Sphere displays this sequence of numbers (see also OEIS A001676 and the Milnor link therein) for the order of the classses as $$1, \;1, \;1,\; 1,\; 1, \;1, \;28,\; 2,\; ...
Tom Copeland's user avatar
  • 10.5k
7 votes
0 answers
557 views

Graphs with graphic imbalance sequences

Let $G$ be simple undirected graph and $e=uv\in E(G)$. The imbalance of the edge $e$ is the value $imb(e)=|d(u)-d(v)|$. Let $M_{G}$ denotes the imbalance sequence (or more correctly, multiset of ...
Sergiy Kozerenko's user avatar
6 votes
5 answers
546 views

Bounds for $a(n)=a(n-1)+a(\lfloor n/2 \rfloor)$

This is related to problem in graph theory. OEIS defines A033485 as $a(1)=1$ and $a(n)=a(n-1)+a(\lfloor n/2 \rfloor)$. Q1 what are upper bounds and asymptotics for $a(n)$, can we get $\exp(o(n))$? ...
joro's user avatar
  • 25.4k
6 votes
1 answer
2k views

Kindda-Perfect number: Is there a sequence of numbers which are equal to the sum of its proper divisors excluding itself as well as 1?

Perfect number is a positive integer that is equal to the sum of its proper divisors. The smallest perfect number is 6, which is the sum of 1, 2, and 3. Is there a sequence of numbers which are equal ...
Nikhil Bhavar's user avatar
6 votes
2 answers
741 views

Shifting an irrational binary sequence

Let $\newcommand{\tn}{\{0,1\}^\mathbb{N}}\tn$ be the collection of all infinite binary sequences. For $s\in\tn$ and $k\in\mathbb{N}$ let the left-shift of $s$ by $k$ positions, $\ell_k(s)\in \tn$, be ...
Dominic van der Zypen's user avatar
6 votes
1 answer
367 views

On A057985 and A287066

Let $a(n)$ be A057985 (i.e., start with $0$ and repeatedly substitute: $0 \to 01$, $1 \to 12$, $2 \to 0$). Let $b(n)$ be A287066 (i.e., start with $1$ and repeatedly substitute: $0 \to 01$, $1 \to 12$...
Notamathematician's user avatar
6 votes
3 answers
2k views

What is the motivation and purpose of the Floretion group?

When searching through the Oeis, I came across something called a floretion. Based on the context, it seems to be some sort of algebraic structure. I googled it and found nothing that explained their ...
Halbort's user avatar
  • 1,129
6 votes
1 answer
282 views

Integer sequences with a periodic pattern

Let $A$ and $B$ be two different integers. Let $S$ be a finite integer sequence with exactly $n_A$ $A$s and $n_B$ $B$s. By repeating $S$ infinitely many times we obtain an infinite integer sequence $P$...
De Costa's user avatar
6 votes
2 answers
897 views

Does this sequence of ratios of digit sums have a limit?

I asked this question a few hours ago on MathStackExchange and there it received some attention but we still do not have a proof so I decided to ask it here also, in an unchanged form, and here it is: ...
user avatar
6 votes
1 answer
393 views

Test for pair of odd primes $(p, 2p^2-1)$

Let $a(n)$ be A106483 (i.e., primes $p$ such that $2p^2-1$ is also prime). Let $b(n)$ be an integer sequence such that $b(n) = B$ after the whole transformation where we start with $A = n$, $B = 1$, $...
Notamathematician's user avatar
6 votes
1 answer
402 views

Values of the determinants $\det[(j-k)^m+\delta_{jk}]_{1\le j,k\le n}\ (m=1,2,3,\ldots)$

For positive integers $m$ and $n$, let $D_m(n)$ denote the determinant $\det[(j-k)^m+\delta_{jk}]_{1\le j,k\le n}$, where the Kronecker delta $\delta_{jk}$ is $1$ or $0$ according as $j=k$ or not. ...
Zhi-Wei Sun's user avatar
  • 15.6k
6 votes
1 answer
173 views

$\omega$-de-Bruijn sequences

Let $\omega$ denote the set of non-negative integers. For which integers $n>1$ is there a sequence $b_n: \omega\to\omega$ with the following property? Whenever $v\in\omega^n$ there is a unique $...
Dominic van der Zypen's user avatar

1
2
3 4 5
8