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 A168302 #10 Jun 02 2025 02:12:02
%S A168302 -8,-66,-264,-689,-1255,-1360,684,8502,28842,73150,159588,315549,
%T A168302 580723,1010768,1681640,2694636,4182204,6314574,9307264,13429515,
%U A168302 19013709,26465824,36276980,49036130,65443950,86327982,112659084
%N A168302 The fourth left hand column of triangle A167552.
%H A168302 G. C. Greubel, <a href="/A168302/b168302.txt">Table of n, a(n) for n = 4..1000</a>
%H A168302 <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 A168302 a(n) = (54*n^7 - 1057*n^6 + 7245*n^5 - 24535*n^4 + 45801*n^3 - 47488*n^2 + 25020*n - 5040)/7!.
%F A168302 G.f.: (z^4 + 23*z^3 + 40*z^2 - 2*z - 8)/(z-1)^8.
%F A168302 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 A168302 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) = 2*27.
%t A168302 LinearRecurrence[{8,-28,56,-70,56,-28,8,-1},{-8, -66, -264, -689, -1255, -1360, 684, 8502},50] (* _G. C. Greubel_, Jul 17 2016 *)
%Y A168302 Equals the fourth left hand column of triangle A167552.
%Y A168302 Other left hand columns are A005408, A167554, A167555 and A168303.
%K A168302 easy,sign
%O A168302 4,1
%A A168302 _Johannes W. Meijer_, Nov 23 2009