login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A122878 Periodic sequence of period 21 related to a simple scheduling problem. 1
12, 12, 12, 12, 13, 13, 13, 23, 23, 23, 23, 12, 12, 12, 13, 13, 13, 13, 23, 23, 23, 12, 12, 12, 12, 13, 13, 13, 23, 23, 23, 23, 12, 12, 12, 13, 13, 13, 13, 23, 23, 23, 12, 12, 12, 12, 13, 13, 13, 23, 23, 23, 23, 12, 12, 12, 13, 13, 13, 13, 23, 23, 23, 12, 12, 12, 12, 13, 13 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

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).

FORMULA

a(n+21) = a(n).

a(n)=(1/105)*{63*(n mod 21)+8*[(n+1) mod 21]+8*[(n+2) mod 21]-42*[(n+3) mod 21]+8*[(n+4) mod 21]+8*[(n+5) mod 21]+8*[(n+6) mod 21]+3*[(n+7) mod 21]+8*[(n+8) mod 21]+8*[(n+9) mod 21)+63*[(n+10) mod 21]+8*[(n+11) mod 21]+8*[(n+12) mod 21]+8*[(n+13) mod 21]-42*[(n+14) mod 21]+8*[(n+15) mod 21]+8*[(n+16) mod 21]+3*[(n+17) mod 21]+8*[(n+18) mod 21]+8*[(n+19) mod 21]+8*[(n+20) mod 21]}, with n>=0 [From Paolo P. Lava (paoloplava(AT)gmail.com), Oct 23 2008]

CROSSREFS

Cf. A122879.

Sequence in context: A129498 A010851 A123896 * A064162 A028996 A113595

Adjacent sequences:  A122875 A122876 A122877 * A122879 A122880 A122881

KEYWORD

nonn

AUTHOR

Rick L. Shepherd (rshepherd2(AT)hotmail.com), Sep 16 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 15:20 EST 2012. Contains 205823 sequences.