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 A359435 #6 Jan 20 2024 16:24:56
%S A359435 0,18,100,425,1666,6370,24228,92277,352594,1351933,5200130,20058103,
%T A359435 77558534,300539938,1166802820,4537567325,17672631538,68923264009,
%U A359435 269128936778,1052049481375,4116715363270,16123801840973,63205303218250,247959266473375,973469712823326
%N A359435 a(n) = binomial(2*n-1,n) - n^2 - 1.
%C A359435 a(n) is the number of ways to place n indistinguishable balls into n distinguishable boxes with at least 2 boxes remaining empty and not all balls placed in one box.
%t A359435 Table[Binomial[2*n - 1, n] - n^2 - 1, {n, 3, 30}] (* _Wesley Ivan Hurt_, Jan 20 2024 *)
%Y A359435 Cf. A352027.
%K A359435 nonn,easy
%O A359435 3,2
%A A359435 _Enrique Navarrete_, Dec 31 2022