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 A094795 #19 Aug 29 2023 18:03:25
%S A094795 265,2119,9403,30637,81901,190435,398959,770713,1395217,2394751,
%T A094795 3931555,6215749,9513973,14158747,20558551,29208625,40702489,55744183,
%U A094795 75161227,99918301,131131645,170084179,218241343,277267657,349044001,435685615
%N A094795 a(n) = (1/n!)*A023043(n).
%H A094795 Milan Janjic, <a href="http://www.pmfbl.org/janjic/enumfun.pdf">Enumerative Formulas for Some Functions on Finite Sets</a>
%H A094795 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (7,-21,35,-35,21,-7,1).
%F A094795 a(n) = n^6 + 15*n^5 + 100*n^4 + 355*n^3 + 694*n^2 + 689*n + 265.
%F A094795 G.f.: -(265 + 264*x + 135*x^2 + 40*x^3 + 15*x^4 + x^6)/(x-1)^7. - _R. J. Mathar_, Nov 15 2019
%F A094795 P-recursive: n*a(n) = (n+7)*a(n-1) - a(n-2) with a(0) = 265 and a(1) = 2119. Cf. A094791. - _Peter Bala_, Jul 25 2021
%t A094795 LinearRecurrence[{7,-21,35,-35,21,-7,1},{265,2119,9403,30637,81901,190435,398959},30] (* _Harvey P. Dale_, Aug 29 2023 *)
%Y A094795 Cf. A001563, A001564, A001565, A001688, A001689, A023043.
%Y A094795 Cf. A094791, A094792, A094793, A094794.
%K A094795 nonn,easy
%O A094795 0,1
%A A094795 _Benoit Cloitre_, Jun 11 2004