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!)
A036054 Number of different cycle lengths of the permutation created by length sorting on the partitions of n. 1

%I #12 Oct 21 2020 02:48:57

%S 1,1,1,2,2,2,2,3,4,4,5,5,6,5,4,6,8,7,7,6,12,9,7,8,10,6,11,12,10,8,9,

%T 10,13,12,14,10,16,9,10,11,10,10,8,10,10,18,14,22,10,15,9,15,12,9,14,

%U 13,13,11,13,16,9,15,14,13,19,11,14,17,18,13,14,14,19

%N Number of different cycle lengths of the permutation created by length sorting on the partitions of n.

%o (PARI)

%o 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)}

%o a(n)={my(u=vecsort([Vecsmall(Vecrev(p)) | p<-partitions(n)])); my(v=vecsort(u, (x,y)->lex(#x,#y), 1+4)); #Set(OrderCycs(v))} \\ _Andrew Howroyd_, Sep 17 2019

%Y Cf. A036045-A036056.

%K nonn

%O 1,4

%A _Olivier GĂ©rard_

%E a(31)-a(50) from _Andrew Howroyd_, Sep 17 2019

%E More terms from _Sean A. Irvine_, Oct 20 2020

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 28 05:02 EDT 2024. Contains 371235 sequences. (Running on oeis4.)