login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A095694
T(n,3) diagonal of triangle in A095693.
0
1, 22, 130, 485, 1400, 3416, 7392, 14610, 26895, 46750, 77506, 123487, 190190, 284480, 414800, 591396, 826557, 1134870, 1533490, 2042425, 2684836, 3487352, 4480400, 5698550, 7180875, 8971326, 11119122, 13679155, 16712410, 20286400, 24475616, 29361992, 35035385, 41594070, 49145250
OFFSET
2,2
REFERENCES
Nicholas S. Horne, Analysis of Viable Network Configurations from a Combinatorial, Graphical and Algebraic Perspective, Diss. Providence College, 2004.
FORMULA
a(n) = (n + 1)*n*(n - 1)*(n^3 + 3*n^2 + 2*n - 16)/48. - corrected by Eric Rowland, Aug 15 2017
G.f.: x^2*(2*x^3-3*x^2+15*x+1)/(1-x)^7. - Colin Barker, Nov 24 2012
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
MATHEMATICA
LinearRecurrence[{7, -21, 35, -35, 21, -7, 1}, {1, 22, 130, 485, 1400, 3416, 7392}, 30] (* Harvey P. Dale, Jul 10 2021 *)
CROSSREFS
Cf. A095693.
Sequence in context: A215626 A125247 A249302 * A233060 A299520 A003778
KEYWORD
easy,nonn
AUTHOR
Nicholas S. Horne (nickhorne(AT)cox.net), Jul 06 2004
STATUS
approved