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 A167567 #5 Jun 16 2016 23:23:21
%S A167567 0,14,124,601,2120,6096,15168,33858,69432,132990,240812,415987,690352,
%T A167567 1106768,1721760,2608548,3860496,5595006,7957884,11128205,15323704,
%U A167567 20806720,27890720,36947430,48414600,62804430,80712684
%N A167567 The fourth left hand column of triangle A167565.
%H A167567 G. C. Greubel, <a href="/A167567/b167567.txt">Table of n, a(n) for n = 4..1000</a>
%H A167567 <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (8,-28,56,-70,56,-28,8,-1).
%F A167567 a(n) = (27*n^7 - 287*n^6 + 1113*n^5 - 1925*n^4 + 1428*n^3 - 308*n^2 - 48*n)/7!.
%F A167567 G.f.: (1*z^3 + 12*z^2 + 14*z + 0)/(1-z)^8.
%F A167567 a(n) = 8*a(n-1) - 28*a(n-2) + 56*a(n-3) - 70*a(n-4) + 56*a(n-5) - 28*a(n-6) + 8*a(n-7) - a(n-8).
%F A167567 a(n) - 7*a(n-1) + 21*a(n-2) - 35*a(n-3) + 35*a(n-4) - 21*a(n-5) + 7*a(n-6) - a(n-7) = 27.
%t A167567 LinearRecurrence[{8, -28, 56, -70, 56, -28, 8, -1}, {0, 14, 124, 601,
%t A167567 2120, 6096, 15168, 33858}, 100] (* _G. C. Greubel_, Jun 16 2016 *)
%Y A167567 Equals the fourth left hand column of triangle A167565.
%Y A167567 Other left hand columns are A000027, A000292, A167566 and A168304.
%K A167567 easy,nonn
%O A167567 4,2
%A A167567 _Johannes W. Meijer_, Nov 10 2009
%E A167567 Formulae and links added by _Johannes W. Meijer_, Nov 23 2009