cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A364893 a(n) is the minimal positive value of m such that A325433(2m, 2n+1) > A364891(2m, 2n+1).

Original entry on oeis.org

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
Offset: 1

Views

Author

Stefano Spezia, Aug 12 2023

Keywords

Crossrefs

Programs

  • 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

Formula

Empirical: a(n) ~ A364894(n). (See p. 5 in Banerjee and Dastidar.)