|
|
A027789
|
|
a(n) = 2*(n+1)*binomial(n+3,4).
|
|
7
|
|
|
4, 30, 120, 350, 840, 1764, 3360, 5940, 9900, 15730, 24024, 35490, 50960, 71400, 97920, 131784, 174420, 227430, 292600, 371910, 467544, 581900, 717600, 877500, 1064700, 1282554, 1534680, 1824970, 2157600, 2537040, 2968064, 3455760, 4005540, 4623150, 5314680
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Number of 8-subsequences of [ 1, n ] with just 3 contiguous pairs.
Also the number of 3-cycles in the n+3 tetrahedral graph. - Eric W. Weisstein, Jul 12 2017
|
|
LINKS
|
|
|
FORMULA
|
G.f.: 2*(2+3x)*x/(1-x)^6.
a(n) = 6*a(n-1) - 15*a(n-2) + 20*a(n-3) - 15*a(n-4) + 6*a(n-5) - a(n-6). - Harvey P. Dale, Jan 20 2015
a(n) = Sum_{k=1..n+1} Sum_{i=1..n+1} (n-i+1) * C(k+1,k-1). - Wesley Ivan Hurt, Sep 21 2017
Sum_{n>=1} 1/a(n) = 61/6 - Pi^2.
Sum_{n>=1} (-1)^(n+1)/a(n) = Pi^2/2 - 8*log(2) + 5/6. (End)
|
|
MAPLE
|
|
|
MATHEMATICA
|
Table[2 (n + 1) Binomial[n + 3, 4], {n, 40}] (* Harvey P. Dale, Jan 20 2015 *)
LinearRecurrence[{6, -15, 20, -15, 6, -1}, {4, 30, 120, 350, 840, 1764}, 40] (* Harvey P. Dale, Jan 20 2015 *)
CoefficientList[Series[(2 (2 + 3 x))/(-1 + x)^6, {x, 0, 20}], x] (* Eric W. Weisstein, Jul 12 2017 *)
|
|
PROG
|
(PARI) for(n=1, 50, print1(2*(n+1)*binomial(n+3, 4), ", ")) \\ G. C. Greubel, Oct 22 2017
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|