|
Search: id:A090279
|
|
|
| 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. |
|
+0
1
|
|
| 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, 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, 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
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
R. Bailey, Change Ringing Resources
David Joyner, Application: Bell Ringing
Index entries for sequences related to bell ringing
|
|
FORMULA
|
Period 24.
|
|
MAPLE
|
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]
|
|
CROSSREFS
|
Cf. A090277-A090284.
Sequence in context: A021971 A021297 A124909 this_sequence A101667 A117378 A088197
Adjacent sequences: A090276 A090277 A090278 this_sequence A090280 A090281 A090282
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jan 24 2004
|
|
|
Search completed in 0.002 seconds
|
