The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A364893 a(n) is the minimal positive value of m such that A325433(2m, 2n+1) > A364891(2m, 2n+1). 2
11, 28, 54, 88, 129, 179, 237, 303, 376, 458, 548, 646, 752, 866, 988, 1118, 1256, 1402, 1558, 1719, 1889, 2067, 2253, 2447, 2650, 2860, 3078, 3304, 3539, 3781, 4031, 4289, 4556, 4830, 5112, 5403, 5701, 6007, 6332, 6644, 6975, 7313, 7659, 8014, 8376, 8747, 9125 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
K. Banerjee and M. G. Dastidar, Inequalities for the partition function arising from truncated theta series, RISC Report Series No. 22-20, 2023.
FORMULA
Empirical: a(n) ~ A364894(n). (See p. 5 in Banerjee and Dastidar.)
MATHEMATICA
A325433[n_, k_]:=(-1)^(k-1)*Sum[(-1)^j*(PartitionsP[n-j*(3*j+1)/2]-PartitionsP[n-j*(3*j+5)/2-1]), {j, 0, k-1}];
A364891[n_, k_]:=(-1)^(k-1)*Sum[(-1)^j*(PartitionsP[n-j(2j+1)]-PartitionsP[n-(j+1)(2j+1)]), {j, 0, k-1}];
nmax=47; a={}; For[n=1, n<=nmax, n++, m=1; While[A325433[2m, 2n+1]<=A364891[2m, 2n+1], m++]; AppendTo[a, m]]; a
CROSSREFS
Sequence in context: A336335 A140677 A264443 * A349660 A242941 A018944
KEYWORD
nonn
AUTHOR
Stefano Spezia, Aug 12 2023
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 28 22:13 EDT 2024. Contains 372921 sequences. (Running on oeis4.)