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 A096341 #16 Jul 27 2021 21:21:28
%S A096341 1,8,71,694,7421,86276,1084483,14665106,212385209,3280842496,
%T A096341 53862855551,936722974958,17205245113141,332864226563324,
%U A096341 6766480571358971,144202473398010826,3215159679583864433
%N A096341 E.g.f.: exp(x)/(1-x)^7.
%C A096341 Sum_{k=0..n} A094816(n,k)*x^k give A000522(n), A001339(n), A082030(n), A095000(n), A095177(n), A096307(n) for x = 1, 2, 3, 4, 5, 6 respectively.
%H A096341 G. C. Greubel, <a href="/A096341/b096341.txt">Table of n, a(n) for n = 0..250</a>
%F A096341 a(n) = Sum_{k = 0..n} A094816(n, k)*7^k.
%F A096341 a(n) = Sum_{k = 0..n} binomial(n, k)*(k+6)!/6!.
%F A096341 a(n) = 2F0(7,-n;;-1). - _Benedict W. J. Irwin_, May 27 2016
%F A096341 From _Peter Bala_, Jul 26 2021: (Start)
%F A096341 a(n) = (n+7)*a(n-1) - (n-1)*a(n-2) with a(0) = 1 and a(1) = 8.
%F A096341 First-order recurrence: P(n-1)*a(n) = n*P(n)*a(n-1) + 1 with a(0) = 1, where P(n) = n^6 + 15*n^5 + 100*n^4 + 355*n^3 + 694*n^2 + 689*n + 265 = A094795(n).
%F A096341 (End)
%t A096341 Table[HypergeometricPFQ[{7, -n}, {}, -1], {n, 0, 20}] (* _Benedict W. J. Irwin_, May 27 2016 *)
%t A096341 With[{nn = 250}, CoefficientList[Series[Exp[x]/(1 - x)^7, {x, 0, nn}], x] Range[0, nn]!] (* _G. C. Greubel_, May 27 2016 *)
%Y A096341 Cf. E.g.f. exp(x)/(1-x)^k: A000522 (k = 1), A001339 (k = 2), A082030 (k = 3), A095000 (k = 4), A095177 (k = 5), A096307 (k = 6).
%Y A096341 Cf. A094795, A094816.
%K A096341 nonn
%O A096341 0,2
%A A096341 _Philippe Deléham_, Jun 28 2004