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!)
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
FORMULA
a(n) = A000142(n) - A003422(n). - Darío Clavijo, Feb 16 2024
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
(Python)
from sympy import factorial
left_factorial = lambda n: left_factorial(n - 1) + factorial(n - 1) if n > 0 else 0
a = lambda n: factorial(n) - left_factorial(n) # Darío Clavijo, Feb 16 2024
CROSSREFS
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 April 19 04:04 EDT 2024. Contains 371782 sequences. (Running on oeis4.)