OFFSET
1,2
COMMENTS
Sequence taken from the Bessenrodt-Ono paper, page 4, table 2, column of maxp(n), n = 1..14.
For the precise definition of maxp(n) see the theorem 1.1 in the mentioned paper, pages 1-2.
First differs from A000041 at a(8).
LINKS
Christine Bessenrodt and Ken Ono, Maximal multiplicative properties of partitions, arXiv:1403.3352 [math.CO], 2014.
FORMULA
a(n) = A000041(n), if 1 <= n <= 7.
a(n) = 5^(n/4), if n is congruent to 0 {mod 4} and n >= 8.
a(n) = 7*5^((n-5)/4), if n is congruent to 1 {mod 4} and n >= 8.
a(n) = 11*5^((n-6)/4), if n is congruent to 2 {mod 4} and n >= 8.
a(n) = 11*7*5^((n-11)/4), if n is congruent to 3 {mod 4} and n >= 8.
MATHEMATICA
a[n_] := If[n <= 7, PartitionsP[n], Switch[Mod[n, 4], 0, 5^(n/4), 1, 7*5^((n-5)/4), 2, 11*5^((n-6)/4), 3, 11*7*5^((n-11)/4)]];
Array[a, 40] (* Jean-François Alcover, Sep 23 2018 *)
PROG
(PARI) a(n) = {if (n <= 7, numbpart(n), my(nmf = n % 4); if (nmf == 0, 5^(n/4), if (nmf == 1, 7*5^((n-5)/4), if (nmf == 2, 11*5^((n-6)/4), 11*7*5^((n-11)/4)); ); ); ); } \\ Michel Marcus, Mar 16 2014
CROSSREFS
KEYWORD
nonn
AUTHOR
Omar E. Pol, Mar 15 2014
EXTENSIONS
a(22) corrected by Michel Marcus, Jun 14 2022
STATUS
approved