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

 

Logo

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 60, we have over 367,000 sequences, and we’ve crossed 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065355 a(n) = n! - Sum_{k=0..n-1} k!. 4
1, 0, 0, 2, 14, 86, 566, 4166, 34406, 316646, 3219686, 35878886, 435046886, 5704064486, 80428314086, 1213746099686, 19521187251686, 333363035571686, 6024361885107686, 114864714882483686, 2304476522241459686 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
For n > 1, the factorial base representation of a(n) is {n-2, n-3, ..., 1, 0}, i.e., the numbers 0..(n-2) in descending order. - Amiram Eldar, Apr 24 2021
LINKS
MATHEMATICA
Table[ n! - Sum[k!, {k, 0, n - 1} ], {n, 0, 20} ]
PROG
(PARI) a(n) = n! - sum(k=0, n-1, k!); \\ Harry J. Smith, Oct 17 2009
CROSSREFS
Cf. A007623.
Sequence in context: A075140 A037563 A005610 * A162478 A348615 A189392
KEYWORD
easy,nonn
AUTHOR
Floor van Lamoen, Oct 31 2001
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 December 1 23:26 EST 2023. Contains 367503 sequences. (Running on oeis4.)