Questions tagged [integer-sequences]
For questions about sequences of integers. References are often made to the online resource oeis.org.
399 questions
4
votes
1
answer
304
views
Is $p$ is square modulo $F_p$ when $p=4k+1 > 5$?
$F_n$ are the Fibonacci numbers.
In On computing factors of cyclotomic polynomials p.1 for odd square-free $n>1$ the cyclotomic polynomial $\Phi_n(x)$
satisfies:
$$ 4 \Phi_n(x)=A_n(x)^2 - (-1)^{(n-...
- 25.4k
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?
...
- 499
4
votes
1
answer
148
views
Closed form for the A110501 (unsigned Genocchi numbers (of first kind) of even index)
Let $a(n)$ be A110501 (i.e., unsigned Genocchi numbers (of first kind) of even index). Here
$$
a(n) = \sum\limits_{i=1}^{\left\lfloor\frac{n}{2}\right\rfloor}\binom{n}{2i}a(n-i)(-1)^{i-1}, \\
a(1) = 1
...
- 4,948
4
votes
1
answer
322
views
Combinatorics related plane geometry
There are $n$ men, standing one at each vertex of a convex $n$-gon. If they are allowed to move together along sides or diagonals of the polygon to reach another vertex, how many different ways are ...
- 201
4
votes
1
answer
253
views
Betweenness in permutations
Let us consider permutations $\pi$ on $\{1,\dots,n\}$ as sequences $\pi(1),\pi(2),\dots,\pi(n)$. For a permutation $\pi$ let $R(\pi)$ be the ternary relation with $(x,y,z)\in R(\pi)$ whenever element $...
- 205
4
votes
2
answers
303
views
Periods of natural numbers
Define a function $F$ on the natural numbers $\geq 2$ as follows:
Start with $a \geq 2$ and let $b$ be the smallest prime divisor of $a$ and $c:=a+b$ and let $d$ denote the largest prime divisor of $c$...
- 26.5k
4
votes
1
answer
219
views
Numbers $n$ whose representation as the product of two divisors require more digits than that of $n$
Note: Posting in MO since it was unanswered in MSE
Let $f(x)$ be the number of digits in the decimal representation of $x$ e.g. $, f(0) = 1, f(1729) = 4$. If $n = ab$ then we can show that $f(ab) > ...
- 5,470
4
votes
1
answer
217
views
Why do convoluted convolved Fibonacci numbers pop up from this triangle?
Start with this triangle (OEIS A118981). This triangle is simple to generate with the following recurrence relation (though $T(0,0)$ ends up different from the OEIS version):
$$
T(0,0) = 2;T(1,0) = 1;...
- 194
4
votes
1
answer
175
views
A binomial coefficient identity involving two parameters
In a recent calculation I obtain a result involving the following expression depending on two integers $n,m\geq 0$:
$$S(n,m):=\frac{(n+m+1)!}{n!m!}\sum_{l=0}^{n+m}\frac{1}{n+m-l+1}\sum_{\substack{j+k=...
- 1,942
4
votes
2
answers
611
views
Ask for a generating function or an explicit expression of a triangle of positive integers
Preliminaries
I encountered the following triangle of positive integers:
$c_{n,k}$
$n=1$
$n=2$
$n=3$
$n=4$
$n=5$
$n=6$
$n=7$
$n=8$
$k=0$
$1$
$3$
$15$
$105$
$315$
$3465$
$45045$
$45045$
$k=1$
$5$
$...
- 1,101
4
votes
1
answer
435
views
Quadratic progressions with very high prime density
In my previous MO question (see here), I solved the case for arithmetic progressions $f_k(x)=q_k x+1$. The solution is this:
The list of sequences $f_k(x)$, each one corresponding to a specific
$k$, ...
- 3,098
4
votes
0
answers
121
views
Do all nonnegative integers appear in A051521?
For every positive integer $n$, $\tau(n)$ is the number of divisors of $n$. If we list the ratio of each positive integer $n$ to $\tau(n)$，they form a rational sequence
1,1,3/2,4/3,5/2,3/2,…
Because $\...
- 321
4
votes
0
answers
156
views
The smallest sequence without differences among Fibonacci numbers
Given a subset $\mathcal S\subset \mathbb N\setminus\{0\}$
of (strictly) positive integers, we can consider subsets
$A$ of $\mathbb N$ (or $\mathbb Z$) with no differences in
$\mathcal S$.
Examples: ...
- 17.9k
4
votes
0
answers
121
views
$f(n) = \frac{n^2 + n + 4}{2}$, $g(f(n)) = f(g(n))$ such that $g(n)$ is an integer
Let $n$ be a strict positive integer and let's define an integer sequence $f(n)$ :
$$f(n) = \frac{n^2 + n + 4}{2}$$
so
$$
\begin{split}
f (\Bbb N)& \triangleq {3,5,8,12,17,23,30,38,47,\ldots}\\
f(...
- 763
4
votes
0
answers
306
views
How to explain this number-theoretic seeming “almost coincidence”?
For natural numbers $n\geq2$, let $d(n)$ be the number of divisors of $n$, and let
\begin{equation}
g(n)=n\sum_i r_i(p_i-1)
\end{equation}
where $n=\prod_i p_i^{r_i}$ is the factorisation of $n$ as a ...
- 141
4
votes
0
answers
414
views
Explicit formula for tournament sequence
I am looking for an explicit formula for a sequence. The sequence is generated as follows:
There is a tournament with $10$ teams. In the beginning, all teams have a 0-0 win-loss record. The teams are ...
- 41
4
votes
0
answers
300
views
On $\sum_{k=1}^nk^3 = x^3 + y^3$ with $x,y \ge 1$
My question is related to https://oeis.org/A269839.
It is well-known that there are parametric families of solutions for cubes that are sums of consecutive cubes: https://arxiv.org/pdf/1603.08901.pdf. ...
- 701
4
votes
0
answers
97
views
When is $\lfloor C^n \rfloor \mod b$ efficiently computable?
For real irrational $C > 1 $ and natural $n,b$, define
$a(C,n,b)=\lfloor C^n \rfloor \mod b$
Q1 For which $C,b$ is $a(C,n,b)$ computable in time polynomial
in $\log{n}$?
Searching in OEIS ...
- 25.4k
4
votes
0
answers
178
views
Primitive roots modulo primes related to Fibonacci numbers or Lucas numbers
The Fibonacci numbers $F_0,F_1,F_2,\ldots$ and the Lucas numbers $L_0,L_1,L_2,\ldots$ are given by
$$F_0=0,\ F_1=1,\ \text{and}\ F_{n+1}=F_n+F_{n-1}\ (n=1,2,3,\ldots)$$
and
$$L_0=2,\ L_1=1,\ \text{...
- 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:...
- 30.6k
4
votes
0
answers
206
views
Generating a Penrose tessellation around a given tile
Given a starting Penrose tile, I need to build a "spiraling" tessellation around it.
The following picture illustrates the request:
In this example, the starting tile is a "thin rhombus" (the pink ...
- 145
4
votes
0
answers
105
views
Closed form for integer series from enumerative geometry problem?
Is there a closed form for the following integer sequence:
$$
1,6,145,8806,830622,100317140,14342519633,2325250316950,...
$$
This is the degree of the $2n$-th power of the Schubert class $\sigma_{2,...
- 17.4k
4
votes
0
answers
302
views
Identities for powers of functions based on generalization of Lagrange interpolation
Lagrange polynomial can be used to obtain an identity:
$$(k+t)^n = \sum_{i=0}^n (k+d_i)^n \prod_{\substack{j=0\\ j\not=i}}^n \frac{t-d_j}{d_i-d_j},$$
which holds for any integer $n>0$, any real ...
- 34.4k
3
votes
1
answer
333
views
$\pi(x+200)-\pi(x)\leq 50$?
Is it true, that $\forall x \in \mathbb N, \pi(x+200)-\pi(x) \leq 50 $ ?
$$\pi(x)=\text{card}(\{n \in [0,x] \cap \mathbb N, n\text{ is prime}\})$$
- 4,073
3
votes
1
answer
435
views
What is the connection between these three methods of generating this sequence?
I was recently looking at this problem: “There are a number of balls in a jar, some of them red, some of them white. The odds of picking two at random and both balls being red is 1/2. How many of the ...
- 39
3
votes
1
answer
233
views
Min problem on integers
Let $n$ be any integer greater than $2^{10^6}$. Given any $s\le (\log_2 n)/1000$ integers $1=q_1\le q_2\le \cdots q_{s-1}\le q_s=n$. Prove that
$$\min_\ell\left(\sum_{i=1}^\ell q_i\right)\left(\sum_{i=...
3
votes
1
answer
165
views
Are there infinitely many nonzero Euler quotients $a(n)=\frac{2^{\phi(n)}-1}{n} \bmod n$?
This might be related to an open problem.
For odd natural $n$ define the Euler quotient:
$$ a(n)=\frac{(2^{\phi(n)}-1) \bmod n^2}{n}=\frac{2^{\phi(n)}-1}{n} \bmod n$$
Q1 Are there infinitely many $n$ ...
- 25.4k
3
votes
2
answers
197
views
Limit of the Schröder numbers ratio
I have been playing around with interesting integer sequences and came across Schröder number which defines the number of lattice paths of n x n grid.
The recurrence formula to calculate these numbers ...
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 ...
- 843
3
votes
1
answer
329
views
Nonexistence of short integer program sequence which generates squares
Is there a way to show within an integer program with constant number of variables and constraints of length $poly(\log B)$ (say length $\leq10^{1000000}\log B$), it is not possible for a variable to ...
- 13.9k
3
votes
3
answers
696
views
For any prime $p$, is there $C$ such that if $x\ge C$, then all but one integer among $x+1, x+2, \dots, x+p$ has Greatest Prime Factor $> p$
I apologize if this is a naive question about greatest prime factors (gpf). I was thinking about the sequence of integers where $\mathrm{gpf}(x) \le p$ where $p$ is any prime.
Clearly, as $x$ ...
- 1,049
3
votes
1
answer
159
views
Limit associated with two Beatty sequences that are not a Beatty pair
Suppose that $r>1$ and $s>1$ are irrational numbers, and let $a_n=\lfloor nr \rfloor$ and $b_n=\lfloor ns \rfloor$. Assume that $r$ and $s$ are numbers for which $\{a_n\}\cap\{b_n\}$ is ...
- 479
3
votes
1
answer
308
views
Tangent numbers, secant numbers and permanent of matrices
Inspired by Question 402572, I consider the permanent of matrices
$$f(n)=\mathrm{per}(A)=\mathrm{per}\left[\operatorname{sgn} \left(\sin\pi\frac{j+2k}{n+1} \right)\right]_{1\le j,k\le n},$$
where $n$ ...
- 884
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 ...
- 133
3
votes
1
answer
240
views
The sequence $a(n)=(2^n \bmod p)^{p-1} \bmod p^2$
Related to this question.
Let $p$ be prime and $n$ positive integer.
Define $a(n)=(2^n \bmod p)^{p-1} \bmod p^2$
Let $D(n)$ be the base $2$ discrete logarithm of $a(n)$, i.e.
given $p,a(n)$ we have $2^...
- 25.4k
3
votes
1
answer
138
views
Properties of a certain sequence
During research I came to the following sequence:
Let $\lambda>1$
and define $n_{k+1}=\text{IntergerPart}[\lambda\cdot n_k]$ where we assume that $n_0$ is sufficently large integer, so that the ...
- 589
3
votes
1
answer
173
views
How many flips of a fair coin are needed to get at least one run of at least $k$ consecutive heads with probability $\ge1/2$?
The following question was asked today:
How many flips $n$ of a fair coin are needed to get at least one run of at least $k$ consecutive heads with probability $P_{k,n}\ge1/2$?
The question was ...
- 128k
3
votes
1
answer
247
views
A special type of Langford pairing
A Langford pairing is a permutation of the sequence of 2n numbers 1, 1, 2, 2, ..., n, n in which the two 1s are one unit apart, the two 2s are two units apart, and more generally the two copies of ...
- 3,717
3
votes
1
answer
611
views
Is there a better proof for this than using the 10-adic numbers?
Here are two somewhat strange sums using the shifted decimal forms of the powers of $3.$
$\begin{equation*}\begin{array}{ccccccc}
&1&&&&&& \\
&&3&&&&...
- 30.1k
3
votes
1
answer
447
views
An interesting problem which I think only needs elementary number theory
A problem about elementary number theory
While writing my paper, I came across the following problem:
(all the discussion assume that $q$ is prime and $\alpha $ is a positive integer. ) We first ...
- 363
3
votes
1
answer
298
views
Sequences with integral variances
This is a companion to my earlier question,
Sequences with integral means.
This new question is, frankly, not as interesting, but it feels necessary to complete
the thought.
Let $V(n)$ be the ...
- 151k
3
votes
1
answer
92
views
Partition of $(2^{n+1}+1)2^{2^{n-1}+n-1}-1$ into parts with binary weight equals $2^{n-1}+n$
Let $\operatorname{wt}(n)$ be A000120, i.e., number of $1$'s in binary expansion of $n$ (or the binary weight of $n$).
Let $a(n,m)$ be the sequence of numbers $k$ such that $\operatorname{wt}(k)=m$. ...
- 4,948
3
votes
1
answer
140
views
Sequences that sum up to Dowling numbers
Let $a(n,k)$ be the sequence of $k$-Dowling numbers (for more information see A007405 and its CROSSREFS section) with e.g.f.
$$\operatorname{exp}\left(x + \frac{\operatorname{exp}(kx) - 1}{k}\right)$$
...
- 4,948
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 ...
- 5,590
3
votes
1
answer
344
views
Another integral that has a closed form involving finite series of $\zeta(2k+1)$'s. Could it be reflexive?
In the context of a series of questions here, here and here, about closed form expressions involving finite series of $\zeta(2k+1)$'s for certain integrals, I would like to raise another one:
$$f(n):=...
- 4,169
3
votes
0
answers
128
views
Fast and simple algorithm for the A329369
Let $a(n)$ be A329369 (i.e., number of permutations of $\{1,2,\cdots,m\}$ with excedance set constructed by taking $m-i$ ($0 < i < m$) if $b(i-1) = 1$ where $b(k)b(k-1)\cdots b(1)b(0)$ ($0 \...
- 4,948
3
votes
0
answers
120
views
Sequence which is related to the binary expansion of $n$ and partition numbers
Let $p(n)$ be A000041 i.e. the number of partitions of $n$ (the partition numbers).
Let
$$
\ell(n)=\left\lfloor\log_2 n\right\rfloor
$$
Let $\operatorname{wt}(n)$ be A000120 i.e. number of $1$'s in ...
- 4,948
3
votes
0
answers
69
views
Sequence that sum up to A343685
Let $a(n)$ be A343685 i.e.
$$
a(n)=2na(n-1)+\sum\limits_{j=0}^{n-1}\binom{n}{j}(n-j-1)!a(j), \\
a(0)=1
$$
Here the exponential generating function $A(x)$ satisfy
$$
A(x)=\frac{1}{1-2x+\log(1-x)}
$$
...
- 4,948
3
votes
0
answers
165
views
Closed form for $a(2^m(2^n-2^p-1))$
Let $q(n)$ be A007814, i.e., the number of trailing zeros in the binary representation of $n$. Here
$$q(2n+1)=0, q(2n)=q(n)+1$$
Let $a(n)$ be A329369. Here
$$a(2n+1)=a(n), a(2n)=a(n)+a(n-2^{q(n)})+a(...
- 4,948
3
votes
0
answers
195
views