login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036882 Number of partitions of 5n such that cn(1,5) = cn(4,5) <= cn(2,5) = cn(3,5) <= cn(0,5). 5
1, 1, 3, 8, 22, 54, 128, 282, 602, 1235, 2474, 4831, 9263, 17418, 32242, 58737, 105519, 186976, 327238, 565896, 967910, 1638175, 2745588, 4558864, 7503737, 12248234, 19835700, 31882617, 50881290, 80648122, 126998962, 198743334, 309163475, 478177505, 735522058 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

Alternatively, number of partitions of 5n such that cn(2,5) = cn(3,5) <= cn(1,5) = cn(4,5) <= cn(0,5).

For a given partition cn(i,n) means the number of its parts equal to i modulo n.

LINKS

Table of n, a(n) for n=0..34.

Index and properties of sequences related to partitions of 5n

FORMULA

a(n) = A036889(n) + A036887(n)

a(n) = A202085(n) + A036891(n)

MAPLE

mkl:= proc(i, l) local ll, x, j; j:= irem (i, 5); j:= `if` (j=0, 5, j); ll:= applyop (x->x+1, j, l); map (x-> x-min(ll[]), ll) end:

g:= proc (n, i, t) local x; if n<0 then 0 elif n=0 then `if` (t[1]=t[4] and t[4]<=t[2] and t[2]=t[3] and t[3]<=t[5], 1, 0) elif i=0 then 0 elif i=1 then g (0, 0, applyop (x-> x+n, 1, t)) elif i=2 then `if` (t[2]>t[3], 0, g (n-2*(t[3]-t[2]), 1, subsop(2=t[3], t))) elif (i=3 or i=4) and t[i]>t[5] then 0 else g(n, i, t):= g (n, i-1, t) +g (n-i, i, mkl(i, t)) fi end:

a:= n-> g(5*n, 5*n, [0, 0, 0, 0, 0]):

seq(a(n), n=0..15);  # Alois P. Heinz, Jul 07 2009

MATHEMATICA

mkl[i_, l_List] := Module[{ll, x, j}, j = Mod[i, 5]; j = If[j == 0, 5, j]; ll = MapAt [#+1&, l, j]; ll - Min[ll]]; g[n_, i_, t_List] := g[n, i, t] = Which[n<0, 0, n == 0, If[t[[1]] == t[[4]] && t[[4]] <= t[[2]] && t[[2]] == t[[3]] && t[[3]] <= t[[5]], 1, 0], i == 0, 0, i == 1, g[0, 0, MapAt [#+n&, t, 1]], i == 2, If[t[[2]] > t[[3]], 0, g[n - 2*(t[[3]] - t[[2]]), 1, ReplacePart[t, 2 -> t[[3]]]]], (i == 3 || i == 4) && t[[i]] > t[[5]], 0, True, g[n, i, t] = g[n, i-1, t] + g[n-i, i, mkl[i, t]]]; a[n_] := a[n] = g[5*n, 5*n, {0, 0, 0, 0, 0}]; Table[Print["a(", n, ") = ", a[n]]; a[n], {n, 0, 32}] (* Jean-François Alcover, Dec 23 2015, after Alois P. Heinz *)

CROSSREFS

Sequence in context: A027211 A027235 A086596 * A020962 A027243 A110239

Adjacent sequences:  A036879 A036880 A036881 * A036883 A036884 A036885

KEYWORD

nonn

AUTHOR

Olivier Gérard

EXTENSIONS

a(10)-a(32) from Alois P. Heinz, Jul 07 2009

Edited by Max Alekseyev, Dec 11 2011

More terms from Alois P. Heinz, Dec 23 2015

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 20 17:42 EDT 2021. Contains 347588 sequences. (Running on oeis4.)