All Questions
Tagged with nt.number-theory sequences-and-series
612 questions
-2
votes
1
answer
201
views
An equality between $\pi$ and $\Gamma$ function [closed]
Consider the following equality:
$$\sum_{n=1}^{+\infty} (-1)^{n+1} \frac{(\frac{(2n-3)!!}{(2n-2)!!})^2*\frac{\pi}{2}}{n}=\frac{\Gamma(\frac{1}{4})^2}{2\sqrt{2\pi}}-\frac{2\sqrt{2}*\pi^{\frac{3}{2}}}{\...
2
votes
1
answer
120
views
Recursion for the Chebyshev transform of $m^n$
Let
$$
R(n, q, m) = R(n-1, q+1, m) + \sum\limits_{j=0}^{q} (-1)^{q-j}R(n-1, j, m), \\
R(0, q, m) = (m-1)^q
$$
I conjecture that $R(n, 0, m)$ is a Chebyshev transform of $m^n$.
Examples of Chebyshev ...
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, ...
2
votes
0
answers
163
views
Interesting conjecture by Sequence Machine
Let $a(n)$ be A344960 (i.e., position of binary complement of $n$-th word in A341258). By definition, in order to calculate $a(n)$, we need to know A341258. Below we will correspond this sequence with ...
11
votes
3
answers
866
views
Conditions under which $\lim_{s\to1^+}\sum_{n=1}^{\infty}\frac{a_n}{n^s}=\sum_{n=1}^{\infty}\frac{a_n}{n}$
I was working with some Dirichlet series and I realized that I have never seen any general conditions under which
\begin{equation}
\sum_{n=1}^{\infty}\frac{a_n}{n}=\lim_{s\to1^+}\sum_{n=1}^{\infty}\...
2
votes
0
answers
120
views
A sequence linked to irrationality
Let $0 < c < 1$ be a real number and $ x \in \mathbb{R}$. We define the sequence $(u_n)_{n \in \mathbb{N}}$ by :
$$u_0 = x$$
$$ \mathrm{If}, u_n \le c, \mathrm{then}, u_{n + 1} = u_n + (1 - c) $$...
2
votes
0
answers
85
views
Curious sequences associated to continuous fractions
Given a strictly positive initial rational number $x_0$ in $\mathbb Q_>$
we define a sequence $x_0,x_1,\ldots$ recursively by
setting $x_{n+1}=x_n+1/S(x_n)$
for $S(x)=a_0+a_1+\ldots+a_k$
where $[...
4
votes
2
answers
354
views
Number of Salem–Spencer subsets of $\{1,2,3,\dots ,n\}$
I was wondering about sets that do not contain any $3$-term AP, and came to know that the official name of such a set is Salem–Spencer set. I was considering the question of counting the number of ...
0
votes
0
answers
63
views
Pairs of permutations such that $p(n)<2^k$ iff $n<2^k$
Let $p(n)$ be an arbitrary permutation of natural numbers such that $p(n)<2^k$ iff $n<2^k$.
Let $q(n)$ be an inverse permutation of $p(n)$.
Let
$$
\ell(n)=\left\lfloor\log_2 n\right\rfloor
$$
...
5
votes
0
answers
133
views
Formula and smallest solution for the A260711
Let $a(n)$ be A260711 without initial $0$ (i.e., numbers of the form $x^2 - y^2$ with $x > y$ where $x$ and $y$ are odd, $x + y$ is a power of $2$).
The sequence begins with
$$
8, 16, 32, 48, 64, ...
1
vote
0
answers
68
views
On a numbers $k$ with specific $2$-adic valuation
Let $a(n)$ be A002326 (i.e., multiplicative order of $2 \operatorname{mod} 2n+1$).
Let $b(n)$ be A179382 (i.e., the smallest period of pseudo-arithmetic progression with initial term $1$ and ...
3
votes
0
answers
240
views
On thickness of binary polynomials
OEIS A169945 introduces the concept of thickness of a polynomial as the magnitude of the largest coefficient in the expansion of the square of the polynomial. Considering the $2^{n+1}$ polynomials $p(...
0
votes
0
answers
107
views
Formula for individual term of the Proth numbers
Let $a(n)$ be A080075 i.e. Proth numbers: of the form $k2^m + 1$ for $k$ odd, $m \geqslant 1$ and $2^m > k$.
The sequence begins with
$$
3, 5, 9, 13, 17, 25, 33, 41, 49, 57, 65, 81, 97, 113, 129
$$...
2
votes
0
answers
72
views
Possible subsequence of the A110978
Let $a(n)$ be A110978 i.e. odd integers that are nonprime, such that there exist two factors of each number that when multiplied together in binary base, do not ever require the use of a "carry&...
3
votes
1
answer
238
views
Partition numbers and Gaussian binomial coefficient
Let $a(n)$ be A000041 i.e. the number of partitions of $n$ (the partition numbers).
Let $T(n, k)$ be A083906. Here
$$
T(n, k) = [q^k]\sum\limits_{m=0}^{n} \binom{n}{m}_q
$$
where $\binom{n}{m}_q$ ...
2
votes
1
answer
167
views
$R$-recursion for the A143017
Let $a(n)$ be A143017 i.e. number of $\{2-1-3, 2'^e-31\}$-avoiding permutations of size $n$ (see definition in the Elizalde paper). Here
$$
a(n) = \frac{1}{n}\sum\limits_{k=0}^{\left\lfloor\frac{n}{...
1
vote
0
answers
125
views
On a Fibonacci and binary
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
$$
\ell(n) = \left\lfloor\log_2 n\right\rfloor
$$
Let
$$
T(n, k) = \left\lfloor\frac{n}{2^k}\...
11
votes
1
answer
1k
views
Is it true that $\sum_{k=1}^\infty\frac{\binom{2k}k^2}{k16^k}(H_{2k}-H_k)=\frac23\sum_{k=1}^\infty\frac{\binom{2k}k^2H_{2k}}{(2k+1)16^k}$?
On Jan. 27, 2012, I conjectured the identity
$$\sum_{k=1}^\infty\frac{\binom{2k}k^2}{k16^k}(H_{2k}-H_k)=\frac23\sum_{k=1}^\infty\frac{\binom{2k}k^2H_{2k}}{(2k+1)16^k},\tag{$*$}$$
where $H_n$ denotes ...
2
votes
0
answers
91
views
Splitting natural numbers into subsets with sums equal to A066258
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 $a(n)$ be A066258 i.e.
$$
a(n) = F(n)^2F(n+1)
$$
Let $b(n)$ be A345253 i.e. maximal ...
0
votes
0
answers
48
views
$R$-recursion for the A007165
Let $a(n)$ be A007165 i.e. number of $P$-graphs with $2n$ edges. Here ordinary generating function $A(x)$ satisfies
$$
A(x) = \frac{(1 + xA(x))(1 + 2xA(x))}{1 + 2xA(x) - (xA(x))^2}
$$
Let
$$
R(n, q) = ...
1
vote
0
answers
49
views
$R$-recursion for the A036765
Let $a(n)$ be A036765 i.e. number of ordered rooted trees with $n$ non-root nodes and all outdegrees $\leqslant 3$. Here
$$
a(n) = \frac{1}{n+1}\sum\limits_{j=0}^{\left\lfloor\frac{n}{2}\right\rfloor}\...
1
vote
1
answer
99
views
$R$-recursion for the A307389
Let $a(n)$ be A307389 i.e. an integer sequence such that its exponential generating function $A(x)$ satisfies
$$
A(x)=\exp\left(\frac{\exp(2x)-2\exp(x)+2x+1}{2}\right)
$$
The sequence begins with
$$
1,...
1
vote
1
answer
116
views
General case of the some $R$-recursions
Let $f(n)$ be an arbitrary function.
Let $a(n)$ be an integer sequence such that its ordinary generating function satisfies
$$
A(x)=\sum\limits_{i=0}^{\infty}\frac{x^i}{\prod\limits_{j=0}^{i}(1-f(j)x)...
15
votes
1
answer
1k
views
The Mompox Sequence: are all its terms different?
The Mompox Sequence, $a(n):=1, 2, 6, 24, 120, 20, \ldots$ (OEIS A008336), is the sequence of positive integers whose first term is $1$, and in which the $n$-th term (after the first one) equals the ...
8
votes
2
answers
2k
views
5n+1 sequence starting at 7
Consider the following variant of the Collatz function: $f:\mathbb N\rightarrow\mathbb N$ is defined by
\begin{equation}
f(n):=\begin{cases}
n/2 & \text{if $n$ is even}\\
5n+1 & \...
4
votes
1
answer
308
views
3 divides coefficents of this $q$-series
Denote $\phi(q):=\prod_{j\geq1}(1-q^j)$ and let $\xi=e^{\frac{2\pi i}3}$ be a cube root of unity.
Define the sequence $u(n)$ by
$$\prod_{n\geq1}\prod_{s=1}^2(1-q^n\xi^{ns})(1-q^{2n}\xi^{ns})
=\sum_{n\...
3
votes
1
answer
468
views
Generalized harmonic numbers and Riemann zeta function
The $n$-th harmonic number is defined as
$$
H_{n}=\sum\limits_{k=1}^{n}\frac{1}{k},
$$
and the generalized harmonic numbers are defined by
$$
H_{n}^{(m)}=\sum\limits_{k=1}^{n}\frac{1}{k^m}.
$$
It is ...
43
votes
3
answers
2k
views
Proving $\sum_{i=1}^{n}\sum_{j=1}^{n}\left\{\frac{x_{i}}{x_{j}}\right\}\le \frac{9}{14}n^2$?
For any postive integer $n$ and for any postive real numbers $x_{1},x_{2},\cdots,x_{n}$, show that
$$\sum_{i=1}^{n}\sum_{j=1}^{n}\left\{\dfrac{x_{i}}{x_{j}}\right\}\le \dfrac{9}{14}n^2$$
Let
\begin{...
1
vote
0
answers
71
views
Slightly modified program for the A345253 such that specific partial sums equal A066258
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 $a(n)$ be A345253 i.e. maximal Fibonacci tree: arrangement of the positive integers as ...
7
votes
1
answer
332
views
A conjectured series expression for the Riemann $\xi$-function and/or Completed L-series. Could this be proven?
This post builds on an MSE question about a conjectured series expression for the Riemann $\xi$-function:
$$\xi(s) = \xi(1-s) = \sum_{n=1}^\infty (-1)^{n+1}\,\big(\xi\left(s+in\right)+\xi\left(1-s+in\...
4
votes
1
answer
206
views
Partition numbers as the specific sums of the A161511
Let $p(n)$ be A000041 i.e. number of partitions of $n$ (the partition numbers).
Let
$$
\ell(n)=\left\lfloor\log_2 n\right\rfloor
$$
Let $a(n)$ be A161511 i.e. number of $1\cdots0$ pairs in the ...
1
vote
0
answers
281
views
Amateur Exploring the 'Honeycomb Sequence': A Novel Mathematical Pattern Derived from Pascal's Triangle [closed]
I am an amateur, and for fun, I was studying a specific number sequence I called the "Honeycomb Sequence," derived from hexagonal patterns in Pascal's Triangle. The sequence involves ...
13
votes
1
answer
468
views
Four new series for $\pi$ and related identities involving harmonic numbers
Recently, I discovered the following four new (conjectural) series for $\pi$:
\begin{align}\sum_{k=1}^\infty\frac{(5k^2-4k+1)8^k\binom{3k}k}{k(3k-1)(3k-2)\binom{2k}k\binom{4k}{2k}}&=\frac{3\pi}2,\...
3
votes
0
answers
70
views
$R$-recursion for the A249833 (similar to A235129)
Let $a(n)$ be A249833 i.e. an integer sequence such that its exponential generating function $A(x)$ satisfies
$$
A(x) = 1 + \int A(x) + (A(x))^2\log A(x)\,dx
$$
The sequence begins with
$$
1, 1, 2, 7, ...
2
votes
0
answers
103
views
$R$-recursion for the A235129
Let $a(n)$ be A235129 i.e. an integer sequence such that its exponential generating function $A(x)$ satisfies
$$
A'(x) = 1 + A(x)\exp(A(x))
$$
The sequence begins with
$$
1, 1, 3, 12, 64, 424, 3358, ...
57
votes
0
answers
3k
views
On the first sequence without triple in arithmetic progression
In this Numberphile video (from 3:36 to 7:41), Neil Sloane explains an amazing sequence:
It is the lexicographically first among the sequences of positive integers without triple in arithmetic ...
5
votes
1
answer
374
views
Closed-form for the number of partitions of $n$ avoiding the partition $(4,3,1)$
Let $a(n)$ be A309099 i.e. the number of partitions of $n$ avoiding the partition $(4,3,1)$.
We say a partition $\alpha$ contains $\mu$ provided that one can delete rows and columns from (the Ferrers ...
2
votes
0
answers
70
views
Elementary recursion for the A258173
Let $a(n)$ be A258173 i.e. sum over all Dyck paths of semilength $n$ of products over all peaks $p$ of $y_p$, where $y_p$ is the $y$-coordinate of peak $p$.
A Dyck path of semilength $n$ is a $(x,y)$-...
3
votes
0
answers
164
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(...
6
votes
1
answer
392
views
How to show that $\log 2(1/2\log 2\log 4 + 1/3\log 3\log 6 + \dotsb) + 1/2\log 2 - 1/3\log 3 + 1/4\log 4 - \dotsb = 1/\log 2$ [closed]
I've been studying Ramanujan's work and I stumbled upon this question in the book: Collected Papers of Srinivasa Ramanujan. In there I found question number 769 which is about an infinite sum with ...
2
votes
1
answer
192
views
Does every real number $r\in [0,1]$ have a rational sequence $q_n\to r$ s.t. $q_n$ has (simplified) denominator $n$? [closed]
This seems pretty trivial but I can't seem to figure it out. I think it's obviously true, given an unconstrained convergent sequence we just have to add some filler elements, but I'm having trouble ...
7
votes
1
answer
268
views
Efficiently computing $\sum_k x^{k^2}$ modulo $p$
Let $p$ be prime. There is a whole host of "large" degree polynomials that can be computed efficiently modulo $p$. I was wondering if:
$$q(x) = \sum_{k=0}^{p-1} x^{k^2}$$
is a polynomial ...
8
votes
2
answers
429
views
Let $(a_n)_{n\in N}=(1,2,3,4,6,8,9,12,\cdots)$ list the set$\{2^n3^m\mid m,n\in N\}$. Find $α$ such that $(a_n)\alpha\pmod1$ is not equidistributed
Let $$(a_n)_{n \in \mathbb{N}} = (1,2,3,4,6,8,9,12,16,18,\cdots)$$ be a sequence that is a listing of the set $$\{2^n3^m \mid m,n \in \mathbb{N}\}$$ We need to find an irrational number $\alpha$ such ...
3
votes
4
answers
497
views
Asymptotic for Ramanujan's $\tau$-function
The Ramanujan's $\tau$-function is defined by
$$q\prod_{n=1}^\infty (1-q^n)^{24}=\sum_{n=1}^\infty \tau (n)q^n$$
where $|q|\lt 1$.
Is there a known asymptotic formula for $\tau (n)$ or $|\tau (n)|$, i....
2
votes
0
answers
131
views
Limit of scaled infinite sum with Dirichlet characters modulo 4: is it zero?
I am trying to get an asymptotic formula such as
$$ L_4(s, n) \sim L_4(s) + \rho_n(s)\Lambda_n + \frac{\alpha(s)}{\sqrt{n}} + \frac{\beta(s)}{\sqrt{n\log n}}+\cdots$$
where $L_4(s, n)$ is the first $n$...
1
vote
1
answer
252
views
A vanishing sum and related $p$-adic congruences
Recently I had a curious discovery. Namely, I have made the following conjectures.
Conjecture 1. We have the identity
$$\sum_{k=0}^\infty\frac{(10k-1)\binom{3k}k\binom{6k}{3k}}{(2k+1)512^k}=0.\label{1}...
8
votes
0
answers
351
views
A hypergeometric series for $\sqrt3\pi$ with converging rate $1/9$
Recently, I found a (conjectural) new series for $\sqrt3\pi$:
$$\sum_{k=1}^\infty\frac{(8k-3)\binom{4k}{2k}}{k(4k-1)9^k\binom{2k}k^2}=\frac{\sqrt3\pi}{18}.\label{1}\tag{1}$$
The series converges fast ...
3
votes
0
answers
330
views
Can you prove and/or generalize this formula involving the Möbius function at n = square free numbers for elliptic curve related sequence in the OEIS?
Let $g(n)$ be the Dirichlet inverse of the Euler totient function:
$$g(n) = \sum\limits_{d|n} d \cdot \mu(d)$$
and let $f(x,y)$ be the elliptic equation:
$$f(x,y)=x^3 - x^2 - y^2 - y$$
Show that the ...
6
votes
1
answer
484
views
Three conjectural series for $\pi^2$ and related identities
Recently, I found the following three (conjectural) identities for $\pi^2$:
$$\sum_{k=1}^\infty\frac{145k^2-104k+18}{k^3(2k-1)\binom{2k}k\binom{3k}k^2}=\frac{\pi^2}3,\tag{1}$$
$$\sum_{k=1}^\infty\frac{...
2
votes
1
answer
426
views
Conjecture on A057030
Let $P(n)$ of a sequence $s(1),s(2),s(3),...$ be obtained by leaving $s(1),...,s(n-1)$ fixed and reversing every n consecutive terms thereafter; apply $P(2)$ to $1,2,3,...$ to get $PS(2)$, then apply $...