cp's OEIS Frontend

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.

A095694 T(n,3) diagonal of triangle in A095693.

This page as a plain text file.
%I A095694 #19 Jan 24 2024 00:40:56
%S A095694 1,22,130,485,1400,3416,7392,14610,26895,46750,77506,123487,190190,
%T A095694 284480,414800,591396,826557,1134870,1533490,2042425,2684836,3487352,
%U A095694 4480400,5698550,7180875,8971326,11119122,13679155,16712410,20286400,24475616,29361992,35035385,41594070,49145250
%N A095694 T(n,3) diagonal of triangle in A095693.
%D A095694 Nicholas S. Horne, Analysis of Viable Network Configurations from a Combinatorial, Graphical and Algebraic Perspective, Diss. Providence College, 2004.
%H A095694 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (7,-21,35,-35,21,-7,1).
%F A095694 a(n) = (n + 1)*n*(n - 1)*(n^3 + 3*n^2 + 2*n - 16)/48. - corrected by _Eric Rowland_, Aug 15 2017
%F A095694 G.f.: x^2*(2*x^3-3*x^2+15*x+1)/(1-x)^7. - _Colin Barker_, Nov 24 2012
%F A095694 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). - _Wesley Ivan Hurt_, Apr 12 2023
%t A095694 LinearRecurrence[{7,-21,35,-35,21,-7,1},{1,22,130,485,1400,3416,7392},30] (* _Harvey P. Dale_, Jul 10 2021 *)
%Y A095694 Cf. A095693.
%K A095694 easy,nonn
%O A095694 2,2
%A A095694 Nicholas S. Horne (nickhorne(AT)cox.net), Jul 06 2004