Questions tagged [integer-sequences]
For questions about sequences of integers. References are often made to the online resource oeis.org.
364
questions
0
votes
0
answers
77
views
Constructing a pair of complementary sequences with the perfect differences
Let $F_n$ be A000045, i.e. Fibonacci numbers. Here
$$
F_n = F_{n-1} + F_{n-2}, \\
F_0 = 0, F_1 = 1
$$
Let $g(n,m)$ be A257961. Here
$$
g(n, m) = mF_{n-1} \operatorname{mod} F_n
$$
Let
$$
\varphi=\...
- 3,462
3
votes
1
answer
872
views
What do we know about Lucky numbers?
I'm really fascinated by lucky numbers (Wikipedia; OEIS A000959) and their prime-like characteristics.
Wolfram states: write "out all odd numbers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, .... The ...
- 10.1k
0
votes
0
answers
62
views
Simple non-recursive formula for inverse permutation to A316385
Let
$$
\ell(n)=\left\lfloor\log_2 n\right\rfloor
$$
Let
$$
f(n)=n+2^{\ell(n)+1}
$$
Let $a(n)$ be A316385, i.e. lexicographically earliest sequence of distinct positive terms such that for any $n > ...
- 3,462
1
vote
2
answers
217
views
Values of the Kronecker symbol of recursive sequences
Is there something known about the values of the Kronecker symbol $\left(\frac{a_n}{a_{n+1}}\right)$ if $a_n$ is a recursive sequence? I know something about this if $a_n$ is the Fibonacci sequence or ...
- 8,722
3
votes
0
answers
67
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)}
$$
...
- 3,462
3
votes
1
answer
223
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=...
- 99.1k
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 ...
- 178k
1
vote
0
answers
104
views
Recursion for the Bessel polynomial $y_n(x)$
Let $a(n)$ be A001515 i.e. the Bessel polynomial $y_n(x)$ evaluated at $x=1$. Here
$$
a(n) = (2n-1)a(n-1) + a(n-2), \\
a(0) = 1, a(1) = 2
$$
The closed form is
$$
a(n)=\sum\limits_{k=0}^{n}\binom{n+k}{...
- 2,506
1
vote
0
answers
89
views
Combinatorial interpretation for the more general case of $R(n,0)$
Let $f(n), g(n,m), h(n)$ be an arbitrary functions which equal to the non-negative integers.
Let
$$
R(n,q) = \sum\limits_{j=0}^{f(q)}g(q,j)R(n-1,j),\\
R(0,q) = h(q)
$$
In the comment to the one of ...
- 3,462
0
votes
1
answer
128
views
Series reversion using something like continued fraction
Let $f(n)$ be an arbitrary function such that $f(n)\in\mathbb{Z}$.
Let
$$
F(x)=\sum\limits_{m\geqslant 0}f(m)x^m
$$
Define the operator $\operatorname{SR}$, which is associated with the series ...
- 6,571
26
votes
1
answer
7k
views
Elegant recursion for A301897
Let $a(n)$ be A301897, i.e., number of permutations $b$ of length $n$ that satisfy the Diaconis-Graham inequality $I_n(b) + EX_n(b) \leqslant D_n(b)$ with equality. Here
$$a(n)=\frac{1}{n+1}\binom{2n}{...
- 109k
4
votes
0
answers
119
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(...
- 5,632
2
votes
0
answers
124
views
Recurrence for A004208
Let $a(n)$ be A004208. Here
$$a(n)=n\prod\limits_{j=1}^{n}(2j-1)-\sum\limits_{i=1}^{n-1}a(i)\prod\limits_{j=1}^{n-i}(2j-1)$$
I conjecture that
$$a(n)=R(n-1,0)$$
where
$$R(n,q)=2(q+2)R(n-1,q+1)+\sum\...
- 3,462
2
votes
0
answers
100
views
Sequence of numbers related to line-segment intersections
Question:
what is known about the sequence $\mathbb{X}\subset \mathbb{N}_0$ such that for each $k\in \mathbb{X}$ there exists a set of $n$ points in general position in the Euclidean plane such that ...
- 12.7k
4
votes
0
answers
304
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
14
votes
1
answer
771
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 ...
- 30.7k
-2
votes
1
answer
160
views
Two-variable continuous function which results in an integer if and only if arguments are integer
I am looking for functions $f(x,y)$, real arguments, continuous,
with the following properties:
$f(m,n) = r$, where $r$ is integer $> 0$ if and only if $m,n$ are integers $> 0$.
$f(m,n) \le f(...
- 3
6
votes
1
answer
256
views
Sequence that sums up to the number of permutations avoiding the pattern $1-23-4$
Let $a(n)$ be A113227, i.e., the number of permutations on $[n]\equiv \{1, \ldots, n\}$ avoiding the pattern $1-23-4$.
The sequence begins with
$$1, 1, 2, 6, 23, 105, 549, 3207, 20577, 143239, 1071704,...
- 5,563
3
votes
1
answer
131
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)$$
...
- 6,571
0
votes
0
answers
59
views
Existence of integer sequence under simultaneous constraints
Does there exist a function $f:\Bbb N\to\Bbb N$ such that \begin{align}a_{n+1}&=f(a_n)\\a_{f(n)+1}&=a_n\end{align} implies $\{a_n\}_{n\ge0}$ is a non-constant, positive integer sequence? ...
- 803
7
votes
0
answers
80
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 ...
- 30.7k
2
votes
0
answers
102
views
Sequences that sum up to the many sequences in the OEIS
Let
$$a(n,m,k)=\frac{1}{n}\sum\limits_{j=0}^{n}[n+kj\geqslant 0]\binom{n}{j}\binom{n+kj}{j-1}(m-1)^{j-1}$$
Here square brackets denote Iverson brackets.
There are many sequences in the OEIS that are ...
- 3,462
2
votes
0
answers
67
views
Integer coefficients such that $T(n,k)=R(n,k)-R(n,k-1)$
Let $a(n)$ be A000085, i.e., the number of self-inverse permutations on $n$ letters, also known as involutions; number of standard Young tableaux with $n$ cells. Here
$$a(n) = a(n-1) + (n-1)a(n-2), a(...
- 3,462
1
vote
0
answers
54
views
Recurrence for the number of permutations with a given excedance set
Let
$$\ell(n)=\left\lfloor\log_2 n\right\rfloor$$
$$f(n)=n-2^{\ell(n)}$$
$$T(n,k)=\left\lfloor\frac{n}{2^k}\right\rfloor\operatorname{mod}2$$
$$\operatorname{wt}(2n+1)=\operatorname{wt}(n)+1, \...
- 3,462
1
vote
0
answers
132
views
Recurrence for the A284005
Let
$$\ell(n)=\left\lfloor\log_2 n\right\rfloor$$
$$f(n)=n-2^{\ell(n)}$$
$$T(n,k)=\left\lfloor\frac{n}{2^k}\right\rfloor\operatorname{mod}2$$
$$\operatorname{wt}(2n+1)=\operatorname{wt}(n)+1, \...
- 3,462
0
votes
0
answers
69
views
Permutation that produces permutations
Let $f(n)$ be A000045, i.e., Fibonacci numbers: $f(n)=f(n-1)+f(n-2)$ for $n>1$ with $f(0)=0$ and $f(1)=1$.
Let $g(n)$ be A072649, i.e., $n$ occurs $f(n)$ times. The sequence begins with
$$1, 2, 3, ...
- 3,462
2
votes
0
answers
76
views
Uniqueness of the permutation
Let $f(n)$ be A000045(n), i.e., Fibonacci numbers: $f(n)=f(n-1)+f(n-2)$ for $n>1$ with $f(0)=0$ and $f(1)=1$.
Let $g(n)$ be A072649, i.e., $n$ occurs $f(n)$ times. The sequence begins with
$$1, 2, ...
- 3,462
1
vote
0
answers
165
views
Ask for a proof of an inequality involving the Bernoulli numbers
Let $B_k$ be the Bernoulli numbers and let
\begin{equation}
T_k=\frac{2^{2k}}{(2k)!}|B_{2k}|, \quad k\ge1.
\end{equation}
Prove the inequality
\begin{equation*}
\frac{\frac{1}{k+2}\sum_{j=0}^{k+1}\...
- 838
1
vote
0
answers
109
views
Existence of binary permutations with a given property
Let
$$\ell(n)=\left\lfloor\log_2 n\right\rfloor$$
Let
$$f(n)=n-2^{\ell(n)}$$
Let $a(n)$ be a permutation of the nonnegative integers such that $a(0)=0$, $a(n)=n$ if $n$ is a power of $2$ and ...
- 3,462
2
votes
1
answer
156
views
Permutation and its binary analog
Let $f(n)$ be A000045(n), i.e., Fibonacci numbers: $f(n)=f(n-1)+f(n-2)$ for $n>1$ with $f(0)=0$ and $f(1)=1$.
Let $g(n)$ be A072649, i.e., $n$ occurs $f(n)$ times. The sequence begins with
$$1, 2, ...
- 17.5k
1
vote
0
answers
80
views
Infiniteness of the pairs of sequences with a given conditions
Let
$$\varphi=\frac{1+\sqrt{5}}{2}$$
Let
$$a_1(n)=\left\lfloor n\varphi \right\rfloor, a_2(n)=n+a_1(n)$$
Let $\operatorname{tr}(n)$ be A007814, i.e., the number of trailing zeros in the binary ...
- 3,462
-4
votes
1
answer
244
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, \\
&...
- 1,024
0
votes
0
answers
49
views
Stolarsky array and Stolarsky representation
Let $T(n,k)$ be A035506, i.e., Stolarsky array read by antidiagonals. Here we consider that $T(n,k)=0$ for $n<1, k<1$.
Let $a(n)$ be A200714, i.e., Stolarsky representation interpreted as binary ...
- 3,462
4
votes
0
answers
393
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
1
vote
1
answer
110
views
Coefficients of number of the same terms which are arising from iterations based on binary expansion of $n$
Let
$$\ell(n)=\left\lfloor\log_2 n\right\rfloor$$
Let
$$T(n,k)=\left\lfloor\frac{n}{2^k}\right\rfloor\operatorname{mod}2$$
Here $T(n,k)$ is the $(k+1)$-th bit from the right side in the binary ...
- 30.7k
2
votes
2
answers
168
views
Fibonacci-like sequence
Fix three integers $a, b, c$ and consider a sequence of integers $a_{i,j}$ defined, for $i \ge 0, j \ge 0$, recursively as follows:
$a_{i,0}=1$ for every $i$, $a_{0,j}=a+bj+cj^2$ and, for $i \ge 1, j \...
- 131
1
vote
0
answers
97
views
Subsequence such that $c(a(n))=2^n$
Let $a(n)$ be A060831, i.e., $\sum\limits_{k=1}^{n}\operatorname{number of odd divisors of} k$.
Let
$$\ell(n)=\left\lfloor\log_2 n\right\rfloor$$
Let
$$b(n,k)=2b(n,k-1)-2^{k-1}, b(n,0)=n$$
Let $c(n)$ ...
- 3,462
1
vote
0
answers
68
views
Is this factorization problem in EXP?
Factorization is not known to have a polynomial time algorithm. Traditionally the input length is number of bits in representation of the integer to be factored.
However now consider integers of form $...
- 13.7k
1
vote
1
answer
114
views
Given a real $x>1$, construct an aperiodic substitution sequence whose complexity functions grow like $xn$
The Fibonacci word is a binary sequence defined as follows.
We use a substitution rule $0\to 01$, $1\to 0$. Then, starting with the binary string $0$, apply the substitution rules successively. So we ...
- 60.2k
2
votes
0
answers
157
views
Closed form for the A347205
Let $q(n)$ be A007814, i.e., number of trailing zeros in the binary representation of $n$. Here
$$q(2n+1)=0, q(2n)=q(n)+1$$
Let $\operatorname{wt}(n)$ be A000120, i.e., number of $1$'s in binary ...
- 3,462
2
votes
0
answers
112
views
Closed form for the sum of the integer coefficients
Let $a(n)$ be A002720, i.e., number of partial permutations of an $n$-set; number of $n \times n$ binary matrices with at most one $1$ in each row and column.
$$a(n)=\sum\limits_{k=0}^{n} k!\binom{n}{...
- 3,462
2
votes
0
answers
204
views
Chess pieces metrics in higher dimensions
A couple of days ago, I was thinking about applying the knight (the well-known piece of chess) metric to any cubic lattice $\mathbb{N}^k$, $k \in \mathbb{N}-\{0,1\}$.
I suddenly realized that, from $k ...
- 1,119
0
votes
0
answers
92
views
Closed form for the number of steps required to get $n$ balls in the last box
Let $\operatorname{wt}(n)$ be A000120, i.e., number of $1$'s in binary expansion of $n$ (or the binary weight of $n$).
Then we have an integer sequence given by
$$a(n)=n(n+1)-\sum\limits_{k=0}^{n}\...
- 3,462
1
vote
1
answer
115
views
Cardinality of $\{ n_i + i^k: i \in \mathbb{N} \} \cap [1,T]$ where $\{n_i \}$ is all natural numbers in some order
Let $n_1, n_2, ...$ be a sequence of natural numbers such that $\{n_i: i \in \mathbb{N}\}$ as a set is all of natural numbers. Let $k$ be a positive integer. Is is possible to obtain a lower bound of ...
- 99.1k
2
votes
1
answer
139
views
Asymptotic analysis of a peculiar sum of squares sequence
Let $a,b$ be two positive integers. Let the sequence $\{s_n\}_n$ be the set of all possible sums of squares $a^2+b^2$, such that they are in ascending order
\begin{align*}
& n=1 & s_1=1^2+1^2=...
- 151
0
votes
1
answer
99
views
Non-Wieferich primes with Euler quotient modulo $p$ two and alternating harmonic numbers
Let $b(n)$ denote the Euler quotient modulo $n$.
In OEIS we have A128465 Numbers k such that k divides the numerator of alternating Harmonic number H'((k+1)/2)
For $n>1$ we have $b(A128465(n))=2$.
...
- 30.7k
24
votes
1
answer
2k
views
Parity of the multiplicative order of 2 modulo p
Let $\operatorname{ord}_p(2)$ be the order of 2 in the multiplicative group modulo $p$. Let $A$ be the subset of primes $p$ where $\operatorname{ord}_p(2)$ is odd, and let $B$ be the subset of primes $...
- 49.6k
0
votes
0
answers
100
views
What will be the set of non-Wieferich numbers if the set of non-Wieferich primes is finite?
Integer $n$ is Wieferich number if $2^{\phi(n)}-1 \equiv 0 \pmod {n^2}$.
Wieferich prime is Wieferich number with $n$ prime.
It is an open problem if there are infinitely many Wieferich primes
and ...
- 24.2k
0
votes
1
answer
96
views
Recurrence for the number of steps required to get one ball in each box
Given $n$ balls, all of which are initially in the first of $n$ numbered boxes, $a(n)$ is the number of steps required to get one ball in each box when a step consists of moving to the next box every ...
- 6,571
1
vote
0
answers
66
views
Recurrence for permutation of A007306 (denominators of Farey tree fractions)
Let $a(n)$ be A071585, i.e., numerator of the continued fraction expansion whose terms are the first-order differences of exponents in the binary representation of $4n$, with the exponents of $2$ ...
- 3,462