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 A239568 #33 Mar 08 2017 11:55:18
%S A239568 0,6,27,75,165,315,546,882,1350,1980,2805,3861,5187,6825,8820,11220,
%T A239568 14076,17442,21375,25935,31185,37191,44022,51750,60450,70200,81081,
%U A239568 93177,106575,121365,137640,155496,175032,196350,219555,244755,272061,301587,333450,367770
%N A239568 Number of ways to place 2 points on a triangular grid of side n so that they are not adjacent.
%H A239568 Heinrich Ludwig, <a href="/A239568/b239568.txt">Table of n, a(n) for n = 2..1000</a>
%H A239568 M. J. Hay, J. Schiff, N. J. Fisch, <a href="http://arxiv.org/abs/1508.03499">Maximal energy extraction under discrete diffusive exchange</a>, arXiv preprint arXiv:1508.03499, 2015
%H A239568 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (5,-10,10,-5,1)
%F A239568 a(n) = n*(n-1)*(n-2)*(n+5)/8.
%F A239568 G.f.: 3*x^3*(x-2) / (x-1)^5. - _Colin Barker_, Mar 22 2014
%F A239568 a(n) = Sum_{i=0..n} (i+5)*A000217(i). - _Bruno Berselli_, Apr 29 2014
%F A239568 a(n) = t(t(n,k),n) + n, where t(n,k) = n*(n+1)/2 + k*n and t(n,1) = A000096(n). - _Bruno Berselli_, Feb 28 2017
%o A239568 (PARI) concat(0, Vec(3*x^3*(x-2)/(x-1)^5 + O(x^100))) \\ _Colin Barker_, Mar 22 2014
%Y A239568 Cf. A239567, A032091, A239569 (3 points), A239570 (4 points), A239571 (5 points), A282998 (6 points).
%Y A239568 Regarding the third formula, see similar sequences listed in A241765.
%K A239568 nonn,easy
%O A239568 2,2
%A A239568 _Heinrich Ludwig_, Mar 22 2014