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!)
A215571 Number of permutations of n indistinguishable copies of 1..6 with every partial sum <= the same partial sum averaged over all permutations. 2
1, 139, 746192, 9212531290, 164401445439455, 3611684199828856072, 90695437030756958966384, 2500267880518574604245088816, 73839261438738554611424321993670, 2299118288652572230673921886739695630, 74651909129454094524656449803220566122458 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
EXAMPLE
a(1) = 139: (1,2,3,4,5,6), (1,2,3,4,6,5), ..., (3,4,2,1,6,5), (3,4,2,5,1,6).
MAPLE
b:= proc(l) option remember; local m, n, g;
m, n:= nops(l), add(i, i=l);
g:= add(i*l[i], i=1..m)-(m+1)/2*(n-1);
`if`(n<2, 1, add(`if`(l[i]>0 and i<=g,
b(subsop(i=l[i]-1, l)), 0), i=1..m))
end:
a:= n-> b([n$6]):
seq(a(n), n=0..6);
CROSSREFS
Row n=6 of A215561.
Sequence in context: A302089 A188452 A183491 * A108317 A252963 A114825
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Aug 16 2012
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 March 29 05:48 EDT 2024. Contains 371265 sequences. (Running on oeis4.)