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 A090282 #13 Mar 18 2017 09:53:06 %S A090282 2,1,1,2,3,4,4,3,4,3,2,1,1,2,3,4,3,4,4,3,2,1,1,2,2,1,1,2,3,4,4,3,4,3, %T A090282 2,1,1,2,3,4,3,4,4,3,2,1,1,2,2,1,1,2,3,4,4,3,4,3,2,1,1,2,3,4,3,4,4,3, %U A090282 2,1,1,2,2,1,1,2,3,4,4,3,4,3,2,1,1,2,3,4,3,4,4,3,2,1,1,2,2,1,1 %N A090282 "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 position of bell 2 in n-th permutation. %H A090282 David Joyner, <a href="http://www.usna.edu/Users/math/wdj/book/node158.html">Application: Bell Ringing</a> %H A090282 <a href="/index/Rec#order_21">Index entries for linear recurrences with constant coefficients</a>, signature (1, 0, 0, -1, 1, 0, 0, -1, 1, 0, 0, -1, 1, 0, 0, -1, 1, 0, 0, -1, 1). %H A090282 <a href="/index/Be#bell_ringing">Index entries for sequences related to bell ringing</a> %F A090282 Period 24. %F A090282 From _Chai Wah Wu_, Jul 17 2016: (Start) %F A090282 a(n) = a(n-1) - a(n-4) + a(n-5) - a(n-8) + a(n-9) - a(n-12) + a(n-13) - a(n-16) + a(n-17) - a(n-20) + a(n-21) for n > 21. %F A090282 G.f.: x*(-2*x^20 + x^19 - x^17 - 3*x^16 - 4*x^12 + x^11 + x^10 + x^9 - 4*x^8 - 3*x^4 - x^3 + x - 2)/((x - 1)*(x^4 + 1)*(x^2 - x + 1)*(x^2 + x + 1)*(x^4 - x^2 + 1)*(x^8 - x^4 + 1)). (End) %Y A090282 Cf. A090277-A090284. %K A090282 nonn %O A090282 1,1 %A A090282 _N. J. A. Sloane_, Jan 24 2004