OFFSET
1,3
COMMENTS
The main entry for this problem is A300576. In this version there are two knights who are searching for the princess; each knight can search a different room.
LINKS
Dmitry Kamenetsky, Optimal solutions
FORMULA
It seems that for n >= 3:
if n = 0 mod 6, then a(n) = (n/6)*4 - 1,
if n = 1 or 2 mod 6, then a(n) = floor(n/6)*4,
if n = 3, 4 or 5 mod 6, then a(n) = floor(n/6)*4 + 2.
i.e., a(n) = A302404(n-2).
EXAMPLE
For n = 1, there is only room to search, so a(1) = 1.
For n = 2, the knights search both rooms, so a(2) = 1.
For n = 3, the knights can search the first two rooms twice, so a(3) = 2.
For n = 4 and 5, the knights can search the second and the fourth rooms twice, so a(4) = 2 and a(5) = 2.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Dmitry Kamenetsky, Mar 19 2018
STATUS
approved