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 A373829 #13 Jun 22 2024 16:11:43 %S A373829 0,0,1,0,6,2,36,24,246,240,1920,2424,16920,25920,166440,297360, %T A373829 1809360,3669840,21551040,48666240,279180720,691649280,3908580480, %U A373829 10501787520,58813776000,169809696000,946627274880,2914924320000,16228733875200,52963370208000 %N A373829 Number of inefficient arrangements in A373182, where inefficient means that the maximum number of persons that a seating arrangement can hold is not achieved. %C A373829 The maximum number of persons that can be seated in the arrangements in A373182 in n seats is ceiling(n/2). %C A373829 The seatings here are maximal in the sense that no additional person can be seated without breaking the condition in A373182, but maximum seatings are excluded. %C A373829 The ratio a(n)/A373182(n) -> 1 as n -> infinity (at a much slower initial rate for even n). %F A373829 a(n) = A373182(n) - (ceiling((n+1)/2))!. %e A373829 a(5)=6 are the following seatings, where _ denotes an empty seat. Seatings of 3 people are the maximum for n=5 and those are not included. %e A373829 1 _ _ 2 _ %e A373829 _ 1 _ 2 _ %e A373829 _ 1 _ _ 2 %e A373829 _ 2 _ 1 _ %e A373829 2 _ _ 1 _ %e A373829 _ 2 _ _ 1. %e A373829 For n=9 seats the maximum number of persons that can be seated is 5, hence examples of inefficient arrangements are: %e A373829 3 _ 2 _ 1 _ _ 4 _ %e A373829 _ 3 _ _ 1 _ _ 2 _. %Y A373829 Cf. A081123, A373182. %K A373829 nonn %O A373829 1,5 %A A373829 _Enrique Navarrete_, Jun 19 2024