cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A068983 a(n) = Sum_{k=0..n} (k^k-k!).

Original entry on oeis.org

0, 2, 23, 255, 3260, 49196, 867699, 17604595, 404662204, 10401033404, 295672787215, 9211294233871, 312080173805324, 11423999821072140, 449316582527563515, 18896039733447227131, 846135945932355895308, 40192537618855187742732, 2018612071634068368034711
Offset: 1

Views

Author

Darrell Minor, Apr 02 2002

Keywords

Comments

a(n) = number of non-injective functions [k]->[k] for 1<=k<=n.

Examples

			a(4) = 255 because (1^1-1!)+(2^2-2!)+(3^3-3!)+(4^4-4!) = 255.
		

Crossrefs

Programs

  • Mathematica
    Accumulate[Table[n^n-n!,{n,20}]] (* Harvey P. Dale, Aug 21 2011 *)

Formula

a(n) = Sum_{k=0..n} (k^k-k!).
a(n) = A062970(n) - A003422(n+1). - Alois P. Heinz, Aug 10 2021