Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
1 answer
139 views

(Translation request) Hypotheses of the Blom-Fredberg bounds on denumerants?

I don't know Swedish and I'm not finding the article "G. Blom and C. E. Froberg, On money changing" translated into English... so I tried to read the original (Swedish) with the help of ...
Ramanumpy's user avatar
3 votes
2 answers
285 views

Distinct distances between adjacent equal elements

Let's call a sequence $a_1, \ldots, a_n$ suitable if for any positive integer $d$ there is at most one index $i$ such that $a_i = a_{i + d}$ and all elements $a_{i + 1}, \ldots, a_{i + d - 1}$ are not ...
Mikhail Tikhomirov's user avatar
0 votes
1 answer
61 views

Ordered $m$-tuples with fixed number of changes

Given $1\leq k\leq m$, $2\leq d\leq c i\ln i$ and $2\leq i\leq c'\ln(mi\ln i)$ at some $c,c'>0$ how many sequences (lower and upper bounds) are of form $$z_1,\dots,z_m$$ on the condition that $$0\...
VS.'s user avatar
  • 1,836
15 votes
1 answer
1k views

Arithmetic progressions in stopping time of Collatz sequences

Inspired by the question here, we did a few more simulations of numbers of some specific forms and noticed a pattern. We consider the original $3n+1$ transform where we divide by $2$ if it's even and ...
Yuzuriha Inori's user avatar
5 votes
2 answers
1k views

Proof that $3^ns + \sum_{k=0}^{n-1} 3^{n-k-1}2^{a_k}=2^m.$

How would I go about proving the following: For any odd positive integer $s$, there exists a sequence of nonnegative integers $( a_0, a_1, \cdots, a_{n-1})$ and a nonnegative integer $m$ such that, $...
ReverseFlowControl's user avatar
19 votes
2 answers
2k views

A finite alternating sum

We have stumbled upon the following finite alternating sum, which we have trouble analyzing. The sum is: $$ S_n = \sum_{j=0}^n \frac{ (-1)^j e^{-j} }{j!} (n-j)^j $$ We have observed numerically that ...
Francisco's user avatar
  • 193
1 vote
1 answer
194 views

Does the Kimberling sequence map numbers "arbitrarily far away"?

The Kimberling sequence is a recursively defined "shuffling sequence" (pictorial description here). Let $k:\mathbb{N}\to \mathbb{N}$ be the Kimberling sequence. Does $k$ map members of $\mathbb{N}$ ...
Dominic van der Zypen's user avatar
5 votes
2 answers
393 views

What is this sequence counting?

While solving (a system of) a system of linear equations level-by-level recursively, I am finding some redundant equations for level $n\geq5$. The reason why the redundancies arise is because $P(n)\...
TheTwistedSector's user avatar
3 votes
0 answers
135 views

Permutation of a sequence, such that $y_i+y_{i+1}$ are all distinct

The sequence $x_1, x_2, ..., x_n$ of positive integers contains at least $\frac {2n}{3}+1$ distinct numbers and each of them appears at most three times. How to prove that there is a permutation $y_1, ...
jack's user avatar
  • 3,153
4 votes
1 answer
245 views

Count weighted integer compositions

What is the asymptotic growth of the sequence $$a_n:=\sum_{k\geq 0} 3^k c_{n,k},$$ as $n\rightarrow\infty$, where $c_{n,k}$ denotes the number of integer compositions of $n$ with exactly $k$ many 2s? ...
Torsten Mütze's user avatar
2 votes
2 answers
273 views

Alternating binomial-harmonic sum: evaluation request

Let $H_k=\sum_{j=1}^k\frac1j$ be the harmonic numbers. QUESTION. Can you find an evaluation of the following sum? $$\sum_{a=1}^b(-1)^a\binom{n}{b-a}\frac{H_{b-a}}a.$$
T. Amdeberhan's 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
13 votes
2 answers
2k views

Positive integers written as $\binom{w}2+\binom{x}4+\binom{y}6+\binom{z}8$ with $w,x,y,z\in\{2,3,\ldots\}$

Let $\mathbb N=\{0,1,2,\ldots\}$. Recall that the triangular numbers are those natural numbers $$T_x=\frac {x(x+1)}2\quad \text{with}\ x\in\mathbb N.$$ As $T_x=\binom{x+1}2$, Gauss' triangular number ...
Zhi-Wei Sun's user avatar
  • 15.6k
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
18 votes
1 answer
607 views

Order of Conway's "look and say" recurrence

Let $L_n$ be the length of the $n$th term of Conway's "look and say" sequence (https://oeis.org/A005341). The generating function $F(x)= \sum_{n\geq 0}L_nx^n$ is a rational function, say $P(x)/Q(x)$ ...
Richard Stanley'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
4 votes
0 answers
156 views

Inequalities about tripling and doubling sumsets

Let $A$ be a set of vectors in $\mathbb Z^d$ who $\mathbb R$-span is the whole $\mathbb R^d$. Let $s_i(A)$ denote the size of $A+A+\dots A$ ($i$ times). I am interested in the following: Question 1:...
Hailong Dao's user avatar
  • 30.6k
2 votes
1 answer
196 views

Guess (or upper bound) the general formula for a double sequence

Let $t,s \geq 0$ be integers. We have the following recursive formula: $$f(t+1,s) = f(t,s) + f(t,s-1) + \sum_{0\leq a,b,c \leq h(t):\\a+b+c = s-1}f(t,a)f(t,b)f(t,c),$$ where $$h(t) = \frac{1}{2}3^t -\...
Wuchen's user avatar
  • 515
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
1 vote
1 answer
163 views

How many points appear in the plane when the chain of n-gons is close?

Let $A_{11}A_{12}\cdots A_{1n}$ be a regular $n$ polygon, we call $A_{11}A_{12}\cdots A_{1n}$ is the $1st-n-gons$. Now we construct the $2nd-n-gon$ based two condition as follows: $2nd-n-gons$ is ...
Đào Thanh Oai's user avatar
2 votes
1 answer
740 views

Power tower made of $2$s and $3$s: too high, too soon?

A power tower of a number $x$ is typified by $$ x^{x^{x^{x^{x^{x^{x^{x^{x^x}}}}}}}}.$$ Here, however, we take the liberty of referring to the set $T$ of "$\{2,3\}$-power towers"; i.e., numbers $$...
Clark Kimberling's user avatar
5 votes
1 answer
303 views

Simply generated sequences with mysterious differences

Suppose that $a_0 < a_1,$ $b_0 < b_1,$ and $$a_n=a_1b_{n-1}+a_0b_{n-2}+qn+r$$ for $n \geq 2$, where $a_0,a_1,b_0,b_1,q,r$ are integers such that $(a_n)$ and $(b_n)$ are increasing and ${(|a_n|)}$...
Clark Kimberling's user avatar
20 votes
2 answers
1k views

A possibly surprising appearance of $\sqrt{2}.$

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_1b_{n-1}-a_0b_{n-2} + 2n$$ for $n \geq 2$, where $A$ and $B$ are increasing and every positive integer occurs ...
Clark Kimberling'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
35 votes
8 answers
3k views

Examples of integer sequences coincidences

For the time being, the OEIS website contains almost $300000$ sequences. Each of these sequences is the mark of a specific mathematical concept. Sometimes two (or more) distinct concepts have the ...
-4 votes
1 answer
250 views

What are the patterns of the sequence of polynomials? [closed]

In my research, I obtained a sequence of polynomials (I am only able to compute the first 4 of them): \begin{align} & f(2) = 1+t, \\ & f(3) = 1+4t+3t^2, \\ & f(4) = 1+6t+12t^2+7t^3, \\ &...
Jianrong Li's user avatar
  • 6,211
3 votes
1 answer
91 views

Source coding lexicographic index of finite alphabet sequence with weight (partitions)

My goal is to determine the lexicographic index of an $M$-ary $n$-sequence $\mathbf{x}$ on the subset with an $M$-weight sum constraint: $$S = \{ \mathbf{x} \in \{0, \ldots, M-1\}^n: \sum_{j=1}^n x_j =...
Salmonstrikes's user avatar
1 vote
0 answers
116 views

In search of multiple expressions for a sequence

The sequence $a_n=\sum_{k=0}^n\binom{n}k^24^k$ is listed on OEIS along with a couple of combinatorial interpretations. What interested me at the moment is the plethora of binomial single-sums for the ...
T. Amdeberhan's user avatar
3 votes
2 answers
203 views

Determining the asymptotic behavior of a sequence

I've encountered the following sequences $$ a_k=2^{k+1}\sum_{j=0}^{k-1}a_{k-1-j}a_j,\;a_0=1 $$ $$ b_k=(k+1)\sum_{j=0}^{k-1}b_{k-1-j}b_j,\;b_0=1. $$ I would like to have an estimate of the growth of ...
guacho's user avatar
  • 843
19 votes
2 answers
581 views

Sequences with 3 letters

For a positive integer $n$ I would like to construct long sequences consisting of 0, 1 and 2's such that for any two subsequences consisting of $n$ consecutive elements the number of 0's , 1's or 2'...
user35593's user avatar
  • 2,286
3 votes
1 answer
330 views

Counting Bipartitions

Numerical evidence suggests that $p_2(n) \geq n p(n)$ for large $n$. Here $p(n)$ is the number of partitions of $n$, and $p_2(n)$ is the number of bipartitions of $n$, i.e., ordered pairs of ...
Steven Spallone'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
14 votes
1 answer
835 views

Special configurations on a circle from a homological algebra problem

Here is the short version of the combinatorial problem: Given a positive integer $n \geq 2$. Draw a circle with $2n$ points indexed by the numbers from $\mathbb{Z}/ 2n \mathbb{Z}$. We colour the ...
Mare's user avatar
  • 26.5k
2 votes
1 answer
238 views

"flavored" equivalence classes of permutations

We say two permutations $\pi_1$ and $\pi_2$ in the symmetric group $\mathfrak{S}_n$ are $k$-equivalent, denoted $\pi_1 \sim_k \pi_2$, if one can be determined from the other after a finite number of ...
T. Amdeberhan's user avatar
16 votes
2 answers
1k views

are these polynomials or rationals functions?

Let $x$ be a variable. Define the following family of sequences (reminiscent of Lucas polynomials) according to the rule: $P_0(x):=0, P_1(x):=1$ and for $n\geq2$ by $$P_n(x)=xP_{n-1}(x)-P_{n-2}(x).$$ ...
T. Amdeberhan's user avatar
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
2 votes
1 answer
216 views

Coefficients for Powers of the Mittag-Leffler Function

Considering the one parameter Mittag-Leffler function, $$E_{\alpha}(z)=\sum_{k=0}^\infty\frac{z^{k}}{\Gamma(\alpha k+1)}, \Re(\alpha)>0$$ Considering then the generating function for $E_\alpha(z^...
Eleven-Eleven's user avatar
0 votes
0 answers
315 views

Number Theory and p-Power-Partitioned Numbers

Given any natural number $N = a_{n}a_{n-1}\ldots a_{1}$, we're going to define its digits-partition as the next set $D_{N} = \bigcup_{j=1}^{n}\bigcup_{k=1}^{p(a_{j})}\{(P_{k},j)\}$, where each pair $(...
user avatar
0 votes
0 answers
540 views

Number Theory and d-Self-Contained Numbers

Given any natural number $N = a_{n}a_{n-1}\ldots a_{1}$, let us associate to it the set $S_{N} = \bigcup_{j=1}^{n}\{(a_{j},j)\}$. We're going to define a d-self-contained number as any natural number ...
user avatar
2 votes
1 answer
301 views

Number of subsets that sum to $0$

Suppose you choose $n$ distinct random numbers from a contiguous subset of cardinality $f({\beta, n})$ with at least $f({\alpha_+, n})$ positive and at least $f({\alpha_-, n})$ negative values from a ...
user avatar
5 votes
2 answers
237 views

Are the Gessel sequence integers composite for all $n\ge 3$?

The Gessel sequence is known for Ira Gessel's Lattice Path Conjecture of $2001$, which has been proved by Kauers, Koutschan and Zeilberger in $2009$ with the aid of a computer. Later, other proofs ...
Dietrich Burde's user avatar
27 votes
1 answer
891 views

Why do the adjoint representations of three exceptional groups have the same first eight moments?

For a representation of a compact Lie group, the $n$th moment of the trace of that representation against the Haar measure is the dimension of the invariant subspace of the $n$th tensor power. The ...
Will Sawin's user avatar
  • 149k
2 votes
3 answers
284 views

Making integer multisets graphic

Let $M=(X,f)$ be a multiset, where $X$ is the underlying set of elements and $f:X\rightarrow\mathbb{N}$ is the multiplicity function. For every $k\in\mathbb{N}$ put $k\cdot M:=(X,k\cdot f)$. It is ...
Sergiy Kozerenko's user avatar
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
0 votes
0 answers
224 views

Classic question on integer partitions (with distinct summands)

I guess that the following was solved sometime in the 18th century, but could not find a reference to it. I am interested in approximations to the following integer partition problem: Denote $R(N,L)$ ...
Amir Bar's user avatar
0 votes
1 answer
215 views

Number of squares in a grid under certain conditions

Consider an $(n+1)\times (n+1)$ grid of lattice points in the plane. $A(n):$ # of squares with vertices on the grid. It's relatively well-known that $A(n)=\frac{n(n+1)^2(n+2)}{12}$. Now, $A(n) = B(...
user66997's user avatar
15 votes
0 answers
487 views

Word complexity of primes mod 4

For an infinite binary word $w$, the word complexity $f_w(n)$ is defined as the number of different subwords of length $n$. The asymptotic behavior of this function is an important parameter of the ...
Igor Pak's user avatar
  • 17.1k
0 votes
1 answer
219 views

A square-squareroot integer race sequence involving primes

I wonder what is the expected behavior of this process? Let $f^2_{\mathrm{next}}(n) =$ the next prime after $n^2$. $g_{\mathrm{sqrt}}(n) = \lfloor \sqrt{n} \rfloor$. Now iterate as follows, ...
Joseph O'Rourke'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
14 votes
1 answer
697 views

Are the asymptotics of A003238 known?

Sequence A003238 of the OEIS counts ``rooted trees with $n$ vertices in which vertices at the same level have the same degree.'' The sequence, $a$, begins 1, 1, 2, 3, 5, 6, 10, 11, 16, ... and it is ...
Michael Albert's user avatar