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 A182079 #31 Dec 27 2024 18:20:20
%S A182079 0,0,0,1,1,3,4,7,8,12,13,18,20,26,28,35,37,45,48,57,60,70,73,84,88,
%T A182079 100,104,117,121,135,140,155,160,176,181,198,204,222,228,247,253,273,
%U A182079 280,301,308,330,337,360,368,392,400,425,433,459,468,495,504,532,541,570,580,610,620,651,661,693,704,737,748,782,793,828,840,876,888,925,937,975,988
%N A182079 a(n) = floor(n*floor((n-1)/2)/3).
%C A182079 Maximal number of edge-disjoint cycles of complete graph on n nodes.
%D A182079 J.-C. Bermond, The circuit-hypergraph of a tournament. Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdős on his 60th birthday), Vol. I, pp. 165--180. Colloq. Math. Soc. Janos Bolyai, Vol. 10, North-Holland, Amsterdam, 1975. MR0396319 (53 #187)
%H A182079 G. C. Greubel, <a href="/A182079/b182079.txt">Table of n, a(n) for n = 0..1000</a>
%H A182079 Gary Chartrand, Dennis Gellere, and Stephen Hedetniemi, <a href="https://doi.org/10.1016/0095-8956(71)90065-7">Graphs with forbidden subgraphs</a>, J. Combinatorial Theory Ser. B 10 1971 12--41. MR0285427 (44 #2645).
%H A182079 Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade, and Léo Robert, <a href="https://arxiv.org/abs/2004.11552">Optimal Threshold Padlock Systems</a>, arXiv:2004.11552 [cs.CR], 2020. See also <a href="https://hal.archives-ouvertes.fr/hal-02552281">hal-02552281</a>, 2020.
%H A182079 Sela Fried, <a href="/A182079/a182079.pdf">On A182079</a>, 2024.
%H A182079 <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,-1,0,0,1,-1,-1,1).
%F A182079 Empirical g.f.: x^3*(x^4+x^3+x^2+1)/((1-x)^3*(1+x)^2*(x^2-x+1)*(x^2+x+1) ). - _Colin Barker_, Nov 18 2012
%F A182079 The conjectured g.f. is correct. See links. - _Sela Fried_, Dec 27 2024
%t A182079 Table[Floor[(n/3)*Floor[(n - 1)/2]], {n, 0, 50}] (* _G. C. Greubel_, Aug 20 2017 *)
%o A182079 (PARI) a(n) = n*((n-1)\2)\3 \\ _G. C. Greubel_, Aug 20 2017
%Y A182079 This is a lower bound on A003141. [Bermond]
%K A182079 nonn,easy
%O A182079 0,6
%A A182079 _N. J. A. Sloane_, Apr 10 2012