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 A190395 #13 Sep 12 2015 11:00:26
%S A190395 0,4,76,516,2172,6860,17904,40796,83976,159732,285220,483604,785316,
%T A190395 1229436,1865192,2753580,3969104,5601636,7758396,10566052,14172940,
%U A190395 18751404,24500256,31647356,40452312,51209300,64250004,79946676
%N A190395 Number of ways to place 3 nonattacking grasshoppers on a chessboard of size n x n.
%C A190395 The Grasshopper moves on the same lines as a queen, but must jump over a hurdle to land on the square immediately beyond.
%D A190395 Christian Poisson, Echecs et mathematiques, Rex Multiplex 29/1990, p.829
%H A190395 Vincenzo Librandi, <a href="/A190395/b190395.txt">Table of n, a(n) for n = 1..1000</a>
%H A190395 V. Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Number of ways of placing non-attacking queens, kings, bishops and knights</a> (in English and Czech)
%F A190395 Explicit formula (C. Poisson, 1990): a(n) = 1/6*(n-1)(n^5 +n^4 -2*n^3 -22*n^2 +76*n -72).
%F A190395 G.f.: -4*x^2*(3*x^5 -7*x^4 +4*x^3 +17*x^2 +12*x +1)/(x-1)^7.
%t A190395 CoefficientList[Series[-4 x (3 x^5 - 7 x^4 + 4 x^3 + 17 x^2 + 12 x + 1) / (x - 1)^7, {x, 0, 50}], x] (* _Vincenzo Librandi_, Jun 02 2013 *)
%Y A190395 Cf. A047659.
%K A190395 nonn,easy
%O A190395 1,2
%A A190395 _Vaclav Kotesovec_, May 10 2011