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 A187324 #25 Jan 31 2023 15:02:48
%S A187324 0,0,1,2,2,2,4,4,4,5,6,6,7,7,8,9,9,9,11,11,11,12,13,13,14,14,15,16,16,
%T A187324 16,18,18,18,19,20,20,21,21,22,23,23,23,25,25,25,26,27,27,28,28,29,30,
%U A187324 30,30,32,32,32,33,34,34,35,35,36,37,37,37,39,39,39,40,41,41,42,42,43,44,44,44,46,46,46,47,48
%N A187324 a(n) = floor(n/2) + floor(n/3) - floor(n/4).
%H A187324 Vincenzo Librandi, <a href="/A187324/b187324.txt">Table of n, a(n) for n = 0..10000</a>
%H A187324 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,1,1,0,0,-1).
%F A187324 a(n) = floor(n/2) + floor(n/3) - floor(n/4).
%F A187324 G.f.: x^2*(1 + 2*x + 2*x^2 + x^3 + x^4) / ( (1+x)*(x^2+1)*(1+x+x^2)*(x-1)^2 ). - _R. J. Mathar_, Mar 08 2011
%F A187324 For n > 0, a(n) = A010761(n) - A002265(n). - _Bruno Berselli_, Mar 08 2011
%t A187324 Table[Floor[n/2]+Floor[n/3]-Floor[n/4], {n,0,120}]
%o A187324 (Magma) [Floor(n/2)+Floor(n/3)-Floor(n/4): n in [0..85] ]; // _Vincenzo Librandi_, Jul 18 2011
%o A187324 (Python)
%o A187324 def A187324(n): return (n>>2)+bool(n&2)+n//3 # _Chai Wah Wu_, Jan 31 2023
%K A187324 nonn,easy
%O A187324 0,4
%A A187324 _Clark Kimberling_, Mar 08 2011