a(1)=1; for n>1, a(n) = largest integer k such that the word a(1)a(2)a(3)...a(n-1) is of the form x(y_1)(y_2)...(y_k) where each y_i is of positive length and any y_i and y_j are related by y_i=P(y_j) for some permutation P.

A091976

a(1)=1; for n>1, a(n) = largest integer k such that the word a(1)a(2)a(3)...a(n-1) is of the form x(y_1)(y_2)...(y_k) where each y_i is of positive length and any y_i and y_j are related by y_i=P(y_j) for some permutation P.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =1a(4) =1a(5) =2a(6) =2a(7) =2a(8) =3a(9) =1a(10) =1a(11) =2a(12) =1a(13) =1a(14) =2a(15) =2a(16) =2a(17) =3a(18) =2a(19) =2a(20) =2a(21) =3a(22) =2a(23) =2a(24) =2a(25) =3a(26) =3a(27) =2a(28) =2a(29) =4

External references