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 A286283 #16 May 22 2017 19:22:59
%S A286283 0,0,0,1,2,3,5,7,9,11,14,17,21,24,28,32,37,42,47,52,58,64,70,77,84,91,
%T A286283 98,106,114,122,131,140,149,158,168,178,189,199,210,221,233,245,257,
%U A286283 269,282,295,308,322,336,350,364,379,394,409,425,441,457,473,490,507,525,542,560,578,597
%N A286283 a(n) = floor(7*n^2/48).
%C A286283 A possible formula for, or lower bound on, or at least a benchmark for, A250000.
%H A286283 Colin Barker, <a href="/A286283/b286283.txt">Table of n, a(n) for n = 0..1000</a>
%H A286283 <a href="/index/Rec#order_22">Index entries for linear recurrences with constant coefficients</a>, signature (2, -2, 2, -1, 0, 1, -2, 2, -2, 1, 0, -1, 2, -2, 2, -1, 0, 1, -2, 2, -2, 1).
%F A286283 G.f.: x^3*(1 + x^2 + x^3 + x^5 - x^6 + x^7 - x^8 + x^9 - x^10 + x^11 + x^13 + x^14 + x^16) / ((1 - x)^3*(1 + x)*(1 - x + x^2)*(1 + x^2)*(1 + x + x^2)*(1 + x^4)*(1 - x^4 + x^8)). - _Colin Barker_, May 22 2017
%t A286283 Table[Floor[7 n^2/48], {n, 0, 64}] (* _Michael De Vlieger_, May 22 2017 *)
%Y A286283 Cf. A250000.
%K A286283 nonn,easy
%O A286283 0,5
%A A286283 _N. J. A. Sloane_, May 12 2017