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 A301426 #11 Mar 27 2025 11:36:57 %S A301426 1,1,1,2,2,2,2,3,4,4,4,4,5,6,6,6,6,7,8,8 %N A301426 Number of steps required in the worst case for three knights to find the princess in a castle with n rooms arranged in a line (Castle and princess puzzle). %C A301426 The main entry for this problem is A300576. In this version there are three knights who are searching for the princess; each knight can search a different room. %H A301426 Dmitry Kamenetsky, <a href="/A301426/a301426.txt">Optimal solutions</a> %F A301426 It seems that for n >= 3: %F A301426 if n = 3 mod 5, then a(n) = (n - 3)/5*2 + 1, %F A301426 otherwise a(n) = floor((n - 4)/5)*2 + 2. %F A301426 This conjecture is a(n) = A194222(n) for n>2. - _R. J. Mathar_, Mar 27 2025 %Y A301426 Cf. A300576, A301337. %K A301426 nonn,more %O A301426 1,4 %A A301426 _Dmitry Kamenetsky_, Mar 21 2018