

A036055


Number of cycles of the permutation created by length sorting on the partitions of n.


1



1, 2, 3, 4, 5, 6, 6, 5, 8, 7, 7, 8, 9, 9, 11, 10, 11, 11, 11, 11, 17, 14, 11, 13, 16, 11, 18, 17, 17, 13, 12, 19, 17, 17, 20, 13, 21, 14, 15, 15, 15, 13, 12, 13, 12, 24, 19, 27, 15, 19
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


LINKS

Table of n, a(n) for n=1..50.


PROG

(PARI)
OrderCycs(v)={my(t=vector(#v), L=List()); for(i=1, #v, my(c=0, j=i); while(!t[j], t[j]=1; j=v[j]; c++); if(c, listput(L, c))); Vec(L)}
a(n)={my(u=vecsort([Vecsmall(Vecrev(p))  p<partitions(n)])); my(v=vecsort(u, (x, y)>lex(#x, #y), 1+4)); #OrderCycs(v)} \\ Andrew Howroyd, Sep 17 2019


CROSSREFS

Cf. A036045A036056.
Sequence in context: A272081 A317582 A293705 * A034151 A101272 A006160
Adjacent sequences: A036052 A036053 A036054 * A036056 A036057 A036058


KEYWORD

nonn,more


AUTHOR

Olivier Gérard


EXTENSIONS

a(31)a(50) from Andrew Howroyd, Sep 17 2019


STATUS

approved



