|
%I #22 Mar 17 2024 05:53:05
%S 12,12,12,12,13,13,13,23,23,23,23,12,12,12,13,13,13,13,23,23,23,12,12,
%T 12,12,13,13,13,23,23,23,23,12,12,12,13,13,13,13,23,23,23,12,12,12,12,
%U 13,13,13,23,23,23,23,12,12,12,13,13,13,13,23,23,23,12,12,12,12,13,13
%N Periodic sequence of period 21 related to a simple scheduling problem.
%C Each term is 12, 13, or 23, which can be interpreted as the presence of two of three resources or people: {1,2}, {1,3}, or {2,3}. (If, instead, 0, 1 and 2 are used for these unordered pairs, sequence A122879 results.). This sequence is one symmetric solution to a scheduling problem to balance an ongoing workload simply while maximizing the lengths of scheduled breaks and meeting requirement (*) below. Note that each of 1, 2 and 3 is present in 14 terms of each period and in seven consecutive terms whenever present. Each of 1, 2 and 3 is absent from three consecutive terms or four consecutive terms alternately. Also, if and only if, a(3+7k), where k>=0, is chosen to correspond to the first day of a 7-day workweek, then (*) this schedule requires no more than five workdays per person per workweek. Finally, each resource or person is scheduled to be absent exactly once per named day of the week per 21-day period (and in the same pattern: alternately, i) the three middle days of the week and ii) the last two days of one week and the first two days of the next week).
%H <a href="/index/Rec#order_15">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,0,-1,1,0,0,0,0,0,-1,1).
%F a(n+21) = a(n).
%F G.f.: -x*(23*x^14-10*x^11+22*x^7+x^4+12) / ((x-1)*(x^2+x+1)*(x^12-x^11 +x^9 -x^8+x^6-x^4+x^3-x+1)). - _Colin Barker_, Dec 21 2012
%Y Cf. A122879.
%K nonn,easy
%O 1,1
%A _Rick L. Shepherd_, Sep 16 2006
|
