%I A090279
%S A090279 3,4,1,3,2,1,4,2,4,2,1,4,3,1,2,3,2,3,1,2,4,1,3,4,3,4,1,3,2,1,4,2,4,
%T A090279 2,1,4,3,1,2,3,2,3,1,2,4,1,3,4,3,4,1,3,2,1,4,2,4,2,1,4,3,1,2,3,2,3,
%U A090279 1,2,4,1,3,4,3,4,1,3,2,1,4,2,4,2,1,4,3,1,2,3,2,3,1,2,4,1,3,4,3,4,1
%N A090279 "Plain Bob Minimus" in bell-ringing is a sequence of permutations p_1=(1,
               2,3,4), p_2=(2,1,4,3), .. which runs through all permutations of 
               {1,2,3,4} with period 24; sequence gives number in position 3 of 
               n-th permutation.
%H A090279 R. Bailey, <a href="http://www.ringing.info">Change Ringing Resources</
               a>
%H A090279 David Joyner, <a href="http://www.usna.edu/Users/math/wdj/book/node158.html">
               Application: Bell Ringing</a>
%H A090279 <a href="Sindx_Be.html#bell_ringing">Index entries for sequences related 
               to bell ringing</a>
%F A090279 Period 24.
%p A090279 ring:= proc(k) option remember; local l, a, b, c, swap, h; l:= [1,2,3,
               4]; swap:= proc(i,j) h:=l[i]; l[i]:=l[j]; l[j]:=h end; a:= proc() 
               swap(1,2); swap(3,4); l[k] end; b:= proc() swap(2,3); l[k] end; c:= 
               proc() swap(3,4); l[k] end; [l[k], seq ([seq ([a(), b()][], j=1..3), 
               a(), c()][], i=1..3)] end: a:= n-> ring(3)[modp(n-1, 24)+1]: seq 
               (a(n), n=1..99); [From Alois P. Heinz (heinz(AT)hs-heilbronn.de), 
               Aug 19 2008]
%Y A090279 Cf. A090277-A090284.
%Y A090279 Sequence in context: A021971 A021297 A124909 this_sequence A101667 A117378 
               A088197
%Y A090279 Adjacent sequences: A090276 A090277 A090278 this_sequence A090280 A090281 
               A090282
%K A090279 nonn
%O A090279 1,1
%A A090279 N. J. A. Sloane (njas(AT)research.att.com), Jan 24 2004