This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A324945 #27 Jul 25 2019 03:09:22 %S A324945 1,7,42,234,1264,6776,36094,190560,997774,5199588,27025854,140092710, %T A324945 723510594,3720320512,19044051770,97051434120,492383872912, %U A324945 2486705768206 %N A324945 Number of path change-ringing sequences of length n for 5 bells. %C A324945 a(n) is the number of (change-ringing) sequences of length[*] n when we are looking at sequences of permutations of the set {1,2,3,4,5} that satisfy: %C A324945 1. The position of each bell (number) from one permutation to the next can stay the same or move by at most one place. %C A324945 2. No permutation can be repeated except for the starting permutation which can be repeated at most once at the end of the sequence to accommodate criterion 4. %C A324945 3. The sequence must start with the permutation (1,2,3,4,5). %C A324945 And does not satisfy: %C A324945 4. The sequence must end with the same permutation that it started with. %C A324945 [*]: We define the length of a change-ringing sequence to be the number of permutations in the sequence. %C A324945 With this [*] definition of the length of a change-ringing sequence; for 5 bells we get a maximum length of factorial(5)=120, thus we have 120 possible lengths, namely 1,2,...,120. Hence {a(n)} has 120 terms. For m bells, where m is a natural number larger than zero, we get a maximum length of factorial(m). When denoting the number of path change-ringing sequences of length n for m bells as a_m(n), {a_m(n)} has factorial(m) terms for all m. %H A324945 Jonas K. Sønsteby, <a href="https://github.com/jonassonsteby/change-ringing">Python program</a>. %H A324945 <a href="/index/Be#bell_ringing">Index entries for sequences related to bell ringing</a> %o A324945 (Python 3.7) See Jonas K. Sønsteby link. %Y A324945 4 bells: A324942, A324943. %Y A324945 5 bells: A324944, this sequence. %Y A324945 6 bells: A324946, A324947. %Y A324945 7 bells: A324948, A324949. %Y A324945 8 bells: A324950, A324951. %Y A324945 9 bells: A324952, A324953. %Y A324945 Number of allowable transition rules: A000071. %K A324945 nonn,fini,more %O A324945 1,2 %A A324945 _Jonas K. Sønsteby_, Mar 20 2019 %E A324945 a(12)-a(18) from _Bert Dobbelaere_, Jul 25 2019