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!)
A206816 Sum_{0<j<n} (n!-j!). 4
1, 9, 63, 447, 3447, 29367, 276327, 2856807, 32250087, 395130087, 5225062887, 74201293287, 1126567808487, 18213512883687, 312440245683687, 5668674457011687, 108462341176755687, 2182831421832627687, 46096712669420979687 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,2
LINKS
FORMULA
a(n) = n*n!-p(n), where p(n) is the n-th partial sum of (j!).
a(n) = t(n)-t(n-1), where t = A206817.
EXAMPLE
a(4) = (24-1) + (24-2) + (24-6) = 63.
MATHEMATICA
s[k_] := k!; t[1] = 0;
p[n_] := Sum[s[k], {k, 1, n}];
c[n_] := n*s[n] - p[n];
t[n_] := t[n - 1] + (n - 1) s[n] - p[n - 1];
Table[c[n], {n, 2, 32}] (* A206816 *)
Flatten[Table[t[n], {n, 2, 20}]] (* A206817 *)
PROG
(Sage) [sum([factorial(n)-factorial(j) for j in range(1, n)]) for n in range(2, 21)] # Danny Rorabaugh, Apr 18 2015
CROSSREFS
Sequence in context: A225964 A037508 A037691 * A336670 A065025 A165510
KEYWORD
nonn
AUTHOR
Clark Kimberling, Feb 12 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 March 28 22:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)