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.

A191690 a(n) = n^n-n^(n-1)-n^(n-2)-...-n^2-n-1.

Original entry on oeis.org

0, 1, 14, 171, 2344, 37325, 686286, 14380471, 338992928, 8888888889, 256780503550, 8105545862051, 277635514376232, 10257237069745861, 406615755353655134, 17216961135462248175, 775537745518440716416, 37031913482632035365105
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Jun 11 2011

Keywords

Examples

			a(1)=0 (=1^1-1), a(2)=1 (=2^2-2-1), a(3)=14 (=3^3-3^2-3-1), a(4)=171 (=4^4-4^3-4^2-4-1).
		

Crossrefs

Programs

  • Maple
    A191690 := proc(n) n^n-add( n^j,j=0..n-1) ; end proc: # R. J. Mathar, Jun 23 2011
  • Mathematica
    Table[Total[-n^Range[0,n-1]]+n^n,{n,2,20}] (* Harvey P. Dale, Jul 06 2011 *)
    f[n_] := ((n - 2) n^n + n)/(n - 1) - 1; f[1] = 0; Array[f, 18] (* Robert G. Wilson v, Apr 16 2015 *)
  • PARI
    a(n) = n^n - sum(k=0, n-1, n^k); \\ Michel Marcus, Apr 16 2015
    
  • Sage
    [n^n - sum([n^k for k in range(n)]) for n in range(1,19)] # Danny Rorabaugh, Apr 20 2015

Formula

a(n) = A117667(n)-1. - Robert G. Wilson v, Apr 16 2015
a(n) = n^n - A023037(n). - Danny Rorabaugh, Apr 20 2015