All Questions
7 questions with no upvoted or accepted answers
7
votes
0
answers
226
views
Is there a connection between the sequence of a finite number of Stieltjes constants and the integer partitions number?
Lehmer 1988 and Keiper 1992 made major progress on evaluating the series:
$$\sigma_r = \sum_{k=1}^{\infty} \left( \frac{1}{\rho_k^r} + \frac{1}{(1-\rho_k)^r}\right) \quad r \in \mathbb{N}$$
where $\...
- 4,169
5
votes
0
answers
765
views
Computability of OEIS A034891 ...partitions of n into prime parts (1 included)
On the seqfan mailing list RGWv gave short algorithm for computing A000041 number of partitions of n the partition numbers:
f[1, 1] = 1; f[n_, k_] := f[n, k] = If[n < 0, 0, If[k > n, 0, If[k == ...
- 25.4k
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,938
2
votes
0
answers
72
views
Recursion for the number of partitions of $m^n-1$ into powers of $m$
Let $a(n,m)$ be the number of partitions of $m^n-1$ into powers of $m$. In other words,
$$a(n,m)=[z^{m^n-1}] \prod\limits_{k\geqslant 0} \frac{1}{1-z^{m^k}}$$
Let
$$
R(n,m,q)=\sum\limits_{j=0}^{m(q+1)-...
- 4,938
1
vote
0
answers
95
views
Pretty simple recursion for the A290383
Let $a(n)$ be A290383 i.e. number of set partitions of $[n]$ such that the smallest element of each block is odd. Here
$$
a(n)=b(n,0,0)
$$
where
$$
b(n,m,t)=\sum\limits_{j=1}^{m-t+1}b(n-1,\max(m,j),1-...
- 4,938
1
vote
0
answers
100
views
Conjecture on numbers $k$ having only one partition into parts with same binary weight as a binary weight of $k$
Let $\operatorname{tr}(n)$ be A007814, number of trailing zeros in the binary representation of $n$.
Also, let $\operatorname{ntr}(n)$ be A086784, number of non-trailing zeros in the binary ...
- 4,938
0
votes
0
answers
186
views
Are the numbers $\sum_{n=1}^\infty\frac1{p(n)}$ and $\sum_{n=1}^\infty\frac1{q(n)}$ transcendental?
For each positive integer $n$, let $p(n)$ be the number of partitions of $n$ (i.e., the number of ways to write $n$ as a sum of positive integers), and let $q(n)$ be the number of strict partitions of ...
- 15.6k