0,3

Zeckendorf (Fibonacci) expansion of n (A003714) reinterpreted as a factorial expansion.

Also positions in A055089, A060117 and A060118 of the permutations that are composed of disjoint adjacent transpositions only. (That these positions are same can be seen by comparing algorithms PermRevLexUnrankAMSD, PermUnrank3R, PermUnrank3L in the respective sequences). Thus also positions of the fixed terms in A065181 - A065184. See comment at A065163.

Written as disjoint cycles the permutations are: (), (1 2), (2 3), (3 4), (1 2)(3 4), (4 5), (1 2)(4 5), (2 3)(4 5), etc. Apart from the first one (the identity), these are the only kind of permutations used in campanology when moving from one "change" to next.

Arthur T. White: Ringing the Changes, Math. Proc. Camb. Phil. Soc., September 1983, Vol. 94, part 2, pp. 203-215

Index entries for sequences related to bell ringing

a(n) = PermRevLexRank(CampanoPerm(n))

Zeckendorf Expansions of first few natural numbers and the corresponding values when interpreted as factorial expansions: 0 = 0 = 0, 1 = 1 = 1, 2 = 10 = 2, 3 = 100 = 6, 4 = 101 = 7, 5 = 1000 = 24, 6 = 1001 = 25, 7 = 1010 = 26, 8 = 10000 = 120, etc.,

CampanoPerm := proc(n) local z, p, i; p := []; z := fibbinary(n); i := 1; while(z > 0) do if(1 = (z mod 2)) then p := permul(p, [[i, i+1]]); fi; i := i+1; z := floor(z/2); od; RETURN(convert(p, 'permlist', i)); end;

Subset of A059590. Cf. also A064640.

For PermRevLexRank, see A056019, for fibbinary see A048679 and A003714.

Sequence in context: A095036 A100901 A004791 this_sequence A057914 A057249 A155003

Adjacent sequences: A060109 A060110 A060111 this_sequence A060113 A060114 A060115

nonn,easy,nice

Antti Karttunen, Mar 01 2001