login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A213168 a(n) = n!/2 - (n-1)! - n + 2. 2
0, 0, 4, 33, 236, 1795, 15114, 141113, 1451512, 16329591, 199583990, 2634508789, 37362124788, 566658892787, 9153720575986, 156920924159985, 2845499424767984, 54420176498687983, 1094805903679487982, 23112569077678079981, 510909421717094399980 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,3
COMMENTS
Row sums of A142706 for k=1..n-1.
LINKS
FORMULA
a(n) = A001286(n-1) - n + 2. - Anton Zakharov, Sep 08 2016
D-finite with recurrence: 2*(n-3)*a(n) - (2*n^2-6*n+4)*a(n-1)- 2*(n-3)*(n-2)^2 = 0. - Georg Fischer, Aug 25 2021
E.g.f.: 1/(2-2*x)+log(1-x)+(2-x)*exp(x). - Alois P. Heinz, Aug 25 2021
MAPLE
f:=gfun:-rectoproc({2*(n-3)*a(n) - (2*n^2-6*n+4)*a(n-1)- 2*(n-3)*(n-2)^2, a(2)=0, a(3)=0}, a(n), remember): map(f, [$2..22]); # Georg Fischer, Aug 25 2021
MATHEMATICA
Table[n!/2 - (n - 1)! - n + 2, {n, 2, 20}]
PROG
(Maxima) A213168(n):=n!/2-(n-1)!-n+2$
makelist(A213168(n), n, 2, 30); /* Martin Ettl, Nov 03 2012 */
(Magma) [Factorial(n)/2-Factorial(n-1)-n+2: n in [2..25]]; // Vincenzo Librandi, Sep 09 2016
CROSSREFS
Cf. A001286.
Cf. A200748 (considered as a triangular array).
Sequence in context: A131509 A221030 A081007 * A203212 A041024 A088317
KEYWORD
nonn,easy
AUTHOR
Olivier Gérard, Nov 02 2012
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 28 05:00 EDT 2024. Contains 372020 sequences. (Running on oeis4.)