All Questions
Tagged with nt.number-theory sequences-and-series
92 questions
122
votes
5
answers
27k
views
Is the series $\sum_n|\sin n|^n/n$ convergent?
Problem. Is the series $$\sum_{n=1}^\infty\frac{|\sin(n)|^n}n$$convergent?
(The problem was posed on 22.06.2017 by Ph D students of H.Steinhaus Center of Wroclaw Polytechnica. The promised prize for ...
5
votes
3
answers
633
views
On level $10$ of the McKay-Thompson series of the Monster
(For brevity, the level-6 functions have been migrated to another post.)
I. Level-10 functions
Given the Dedekind eta function $\eta(\tau)$. To recall, for level-6,
$$j_{6A} = \left(\sqrt{j_{6B}} + \...
169
votes
3
answers
40k
views
Convergence of $\sum(n^3\sin^2n)^{-1}$
I saw a while ago in a book by Clifford Pickover, that whether the Flint Hills series $\displaystyle \sum_{n=1}^\infty\frac1{n^3\sin^2 n}$ converges is open.
I would think that the question of its ...
35
votes
2
answers
1k
views
Representations of $\zeta(3)$ as continued fractions involving cubic polynomials
$\zeta(3)$ has at least two well-known representations of the form $$\zeta(3)=\cfrac{k}{p(1) - \cfrac{1^6}{p(2)- \cfrac{2^6}{ p(3)- \cfrac{3^6}{p(4)-\ddots } }}},$$
where $k\in\mathbb Q$ and $p$ is a ...
10
votes
2
answers
731
views
On 12 cfracs: for Catalan's $K$, Gieseking's $\kappa$, and $\pi^2$, $\pi^3$, plus three for $\zeta(3)$ using Zagier's "six sporadic sequences"
I. Some functions
As these will be used in the continued fraction evaluations below, recall the Riemann zeta function $\zeta(s),$ and Dirichlet beta function $\beta(s),$
$$\beta(s) = \sum_{n=1}^\infty\...
9
votes
2
answers
1k
views
About a Ramanujan-Sato formula of level 10, a recurrence, and $\zeta(5)$?
I. Level 6
This is a long shot, but I am curious where it leads. Given the Dedekind eta function $\eta(\tau),$ define,
$$\begin{aligned}
j_{6A}(\tau) &= \Big(\sqrt{j_{6B}(\tau)} - \frac{1}{\sqrt{...
6
votes
1
answer
283
views
On the continued fractions using Cooper's sequences $s_7,\, s_{10},\, s_{18}$ and the Zudilin-Cohen sequence
In a previous MO post, H. Cohen suggested Gorodetsky's 2021 paper which discussed $6+6+3=15$ "sporadic sequences". The first 6 are Zagier's sporadic sequences, the second 6 are by Almkvist-...
3
votes
1
answer
193
views
Sequences that sums up to second differences of Bell and Catalan numbers
Let $f(n)$ be A007814, the exponent of the highest power of $2$ dividing $n$, a.k.a. the binary carry sequence, the ruler sequence, or the $2$-adic valuation of $n$.
Let $g(n)$ be A025480, $g(2n) = n$...
3
votes
1
answer
324
views
Sum with Stirling numbers of the second kind
Let $wt(n)$ be A000120, number of $1$'s in binary expansion of $n$ (or the binary weight of $n$)
and
$$n=2^{t_1}(1+2^{t_2+1}(1+\dots(1+2^{t_{wt(n)}+1}))\dots)$$
Then we have an integer sequence given ...
2
votes
1
answer
261
views
Sequence that sums up to INVERTi transform applied to the ordered Bell numbers
$\DeclareMathOperator\wt{wt}$Let $\wt(n)$ be A000120, number of $1$'s in binary expansion of $n$ (or the binary weight of $n$).
Let $f(n)$ be A007814, the exponent of the highest power of $2$ ...
2
votes
1
answer
183
views
Pair of recurrence relations with $a(2n+1)=a(2f(n))$
Let $f(n)$ be A053645, distance to largest power of $2$ less than or equal to $n$; write $n$ in binary, change the first digit to zero, and convert back to decimal.
Let $g(n)$ be A007814, the ...
71
votes
8
answers
12k
views
Possible new series for $\pi$
In a recent (unfortunately over-hyped) preprint by Saha and Sinha, Field theory expansions of string theory amplitudes (arXiv:2401.05733), they present the following series for $\pi$:
$$\pi = 4 + \...
25
votes
2
answers
2k
views
Do these rational sequences always reach an integer?
This post comes from the suggestion of Joel Moreira in a comment on An alternative to continued fraction and applications (itself inspired by the Numberphile video 2.920050977316 and Fridman, ...
16
votes
1
answer
4k
views
Order of magnitude of $\sum \frac{1}{\log{p}}$
Question: What is the order of magnitude of the following sum?
$$ \sum_{\substack{p<n\\\text{$p$ prime}}} \frac{1}{\log{p}} $$
Additional information: Since
$$ \sum_{\substack{p<n\\\text{...
10
votes
0
answers
350
views
How are the hypergeometric motives of WZ-Pairs connected?
If $\small{(F,G)}$ is a WZ-pair and general asymptotic conditions $\lim_{k\rightarrow\infty}\small{G(n,k)=0}$ and $\lim_{n\rightarrow\infty}\small{F(n,k)=0}$ hold, then we have the certified ...
7
votes
2
answers
265
views
On four Ramanujan-type "Legendrian" sequences with a 3-term recurrence?
I. Recurrences
In a previous post, it was mentioned how Almkvist-Zudilin did a computer search for solutions to the recurrence relation,
$$(n+1)^3s_{n+1}=(2n+1)(an^2+an+b)s_n+c\,n^3s_{n-1}$$
within a ...
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 ...
4
votes
1
answer
208
views
Transformations of Ramanujan's 1/pi formulas $\sum_{n=0}^{\infty} s(n)\frac{An+ B}{C^n}$ and Monster moonshine functions
Someone with many papers on Ramanujan's work asked me how I managed to find the closed-forms for the binomial sums of level $10$ in a recent MO post. (A colleague of his wasn't able to find them.) I ...
3
votes
0
answers
206
views
Ramanujan's pi formulas with a twist (nine years later)
(Note: The second method described here continues this post.)
About nine years ago, I made an MO post "Ramanujan's pi formulas with a twist". An answer was informative, but not completely ...
3
votes
2
answers
973
views
Recursive random number generator based on irrational numbers
Here $\{\cdot\}$ and $\lfloor \cdot\rfloor$ denote the fractional part and floor functions respectively. For a negative, non-integer number $x$, we use the following definition: $\{x\}=1-\{-x\}$. If $...
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 ...
56
votes
1
answer
4k
views
A mysterious connection between primes and $\pi$
The Prime Number Theorem relates primes to the important constant $e$.
Here I report my following surprising discovery which relates primes to $\pi$.
Conjecture (December 15, 2019). Let $s(n)$ be ...
36
votes
2
answers
3k
views
Why does this sequence converges to $\pi$?
One of my daughters was having a small programming exercise.
Let's consider following algorithm:
Take a list of length $n$: $\ (1\,\ 2\,\ \ldots\,\ n)$.
Remove every $2$nd number.
From the ...
24
votes
0
answers
1k
views
Is A276175 integer-only?
The terms of the sequence A276123, defined by $a_0=a_1=a_2=1$ and $$a_n=\dfrac{(a_{n-1}+1)(a_{n-2}+1)}{a_{n-3}}\;,$$ are all integers (it's easy to prove that for all $n\geq2$, $a_n=\frac{9-3(-1)^n}{2}...
24
votes
4
answers
2k
views
Does this sequence always give an integer?
It is known that the $k$-Somos sequences always give integers for $2\le k\le 7$.
For example, the $6$-Somos sequence is defined as the following :
$$a_{n+6}=\frac{a_{n+5}\cdot a_{n+1}+a_{n+4}\cdot ...
23
votes
1
answer
2k
views
Ramanujan's pi formulas with a twist
Given the binomial function $\binom{n}{k}$.
1. Define the following sequences,
$$\begin{aligned}
u_1(k) &= \tbinom{2k}{k}\tbinom{3k}{k}\tbinom{6k}{3k} = 1, 120, 83160, 81681600,\dots \\
u_2(k) &...
11
votes
1
answer
497
views
Sign of the function $f(n)=\sum_{k=1}^n\frac{\mu(k)}{k}$
It is well-known that the Mertens function $M(n)=\sum_{k=1}^n\mu(k)$ changes sign infinitely many times when $n\rightarrow +\infty$. Let $f(n)=\sum_{k=1}^n\frac{\mu(k)}{k}$, then $\lim\limits_{n\...
10
votes
1
answer
554
views
Who was/were the first to note that if $\sum_{x \in X} \frac{1}{x} < \infty$ then the natural density of $X$ is zero?
It is a result of folklore that the natural density of a set $X$ of positive integers such that $\sum_{x \in X} \frac{1}{x} < \infty$ is zero. This is reproved, e.g., in T. Šalát's paper: ...
9
votes
3
answers
745
views
Asymptotic formulas for Monster-related modular functions?
Define the following,
$$j(\tau) = \Big(\tfrac{E_4(\tau)}{\eta^8(\tau)}\Big)^3 = {1 \over q} + 744 + \color{blue}{196884} q + 21493760 q^2 + 864299970 q^3 + \cdots \tag{1}$$
$$j_{2A}(\tau) =\Big(\big(...
7
votes
1
answer
660
views
Are these continued fractions for the "tails" of $\zeta(3)$ and of the Catalan constant known?
For polynomials $a=a(x)$ and $b=b(x)$, define the continued fraction $$f(a,b):=a(1)+ \lower 2pt\overset{\infty }{\underset{n=1}{\mathbb{\LARGE K}}}~\dfrac{b(n)}{a(n+1)}=a(1)+\cfrac{b(1)}{a(2) + \cfrac{...
6
votes
0
answers
136
views
On a certain $(-1)$-Eulerian polynomials of type $B$
Let $(q)_n=(1-q)(1-q^2)\cdots(1-q^n)$ with $(q)_0:=1$. Define a $q$-exponential by
$$e_q(z)=\sum_{n\geq0}\frac{z^n}{(q)_n}.$$
There is a notion of $q$-Eulerian polynomials of type $A$, see the ...
5
votes
1
answer
168
views
On a generating function and vector $\nu$ of length $n$
Let $f(n)$ be an arbitrary function with integer values.
Let $a(n)$ be an integer sequence such that
$$
\frac{1}{1-x}=\sum\limits_{n=0}^{\infty}a(n)x^n\prod\limits_{k=1}^{n+1}(1-f(k)x)
$$
Start with ...
3
votes
1
answer
295
views
Sum with products turned into subsequences
Let $p, q \in \mathbb{Z}$.
Let $\operatorname{wt}(n)$ is A000120, number of $1$'s in binary expansion of $n$ (or the binary weight of $n$) and
$$n=2^{t_1}(1+2^{t_2+1}(1+\dots(1+2^{t_{wt(n)}+1}))\dots)$...
2
votes
0
answers
422
views
Sequences with high densities of primes: how to boost them to get even more and larger primes
I propose a methodology to help find large prime numbers with a much higher probability than picking up random numbers and testing them for primality. This would help speed up prime number generators ...
2
votes
0
answers
159
views
Finding similar Zudilin-Cohen recurrence relations and cfracs for $\frac{\zeta(4)}{13}$?
I. Two recurrence relations
The first one was also discussed in this MO post. We have the similar,
\begin{align}
(n+1)^5 u_{n+1} &= (2n + 1)(9n^2 + 9n + 3)(15n^2 + 15n + 4)u_n +3n^3(9n^2-1)u_{n-1}\...
2
votes
1
answer
172
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, ...
0
votes
1
answer
101
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 ...
51
votes
4
answers
5k
views
Why do Pell equations appear in Ramanujan's pi formulas?
While answering this MSE question about the Pell equation $x^2-29y^2=1$, I noticed that certain fundamental solutions appeared in Ramanujan's famous pi formula.
I. Given the fundamental unit $\...
42
votes
2
answers
2k
views
Numbers that are generic w.r.t. exponentiation
This is a follow-up to my old question Number of distinct values taken by $x\hat{\phantom{\hat{}}}x\hat{\phantom{\hat{}}}\dots\hat{\phantom{\hat{}}}x$ with parentheses inserted in all possible ways.
...
42
votes
4
answers
4k
views
Are these fast convergent series for $\log(2)$, $\log(3)$ and $\log(5)$ already known and proven?
Now that some of the previously MSE formulae that I left here have been applied Dec.2023 to compute high precision record values ($10^{12}$ decimal digits) of trascendental constants $\Gamma(1/3)$ (Eq....
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}{...
26
votes
4
answers
2k
views
For $x$ irrational, is $a_{n} =\sum_{k=1}^{n}(-1)^{⌊kx⌋}$ unbounded?
For $x$ irrational, define $a_{n} :=\sum_{k=1}^{n}(-1)^{⌊kx⌋}$. Can you prove that $\left\{a_n\right\}$ is unbounded?
I feel that it is not easy to treat every irrational $x$.
I have asked in S.E. ...
22
votes
4
answers
2k
views
Freeness of a Z[x]-module
Definition: Call a mapping $f: \mathbb{Z} \rightarrow \mathbb{Z}$
a generalized polynomial if for any distinct integers $m$ and $n$
we have $(m - n)|(f(m)-f(n))$.
It is easy to check that polynomial ...
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 ...
15
votes
2
answers
601
views
Integer but not Laurent sequences
Are there any sequence given by a recurrence relation:
$x_{n+t}=P(x_t,\cdots,x_{t+n-1})$, where $P$ is a positive Laurent Polynomial, satisfy:
if $x_0=\cdots=x_{n-1}=1$, then the sequence is only ...
15
votes
3
answers
1k
views
Does anyone remember what happened to the experimental search for polynomial identities for $\pi$?
So a while back I was on the internet and had encountered a website containing an experimental search for identities for $\pi$. My memory was that the page belonged to either Jonathan Sondow or ...
15
votes
2
answers
1k
views
a weird sequence with a non-integral term
Define a sequence $(a_n)_{n \geq 1}$ by $$na_n = 2 + \sum_{i = 1}^{n - 1} a_i^2.$$
(In particular, $a_1 = 2$.)
How can you show - preferably without using a pc! - that not all terms of the sequence ...
14
votes
1
answer
963
views
Ramanujan's Lost Notebook page 1 first equation and OEIS sequence A260195
In the 1988 Narosa edition of Ramanujan's The Lost Notebook and Other Unpublished Papers, on the first line of page 1 is the following:
$$ \Big(1+\frac1a\Big) \Bigg\{\frac{1}{(1-aq)(1-q/a)}+\frac{q(1+...
13
votes
1
answer
782
views
Cesaro(?)/Euler(?) - summation of the $s(p)=\sum_{k=0}^\infty (-1)^{H(k)} (1+k)^p$ for $p=1,2,3,...$ (where $H(k)$ is the Hamming-weight)
In another thread (in MO) there was a question about a series where the signs at the terms alternate with the "Hamming-weight", that means according to the number of bits in the binary representation ...
13
votes
2
answers
1k
views
Numerology with Ramanujan's pi formula
Given Ramanujan's famous $\frac1{\pi}$ formula $$\frac 1\pi=\frac {2\sqrt2}{99^2}\sum_{k=0}^\infty\frac {(4k)!}{k!^4}\frac {26390k+1103}{396^{4k}}$$
which is a level 2 Ramanujan-Sato series. It can ...