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!)
A191690 a(n) = n^n-n^(n-1)-n^(n-2)-...-n^2-n-1. 4

%I #26 Apr 22 2015 11:50:33

%S 0,1,14,171,2344,37325,686286,14380471,338992928,8888888889,

%T 256780503550,8105545862051,277635514376232,10257237069745861,

%U 406615755353655134,17216961135462248175,775537745518440716416,37031913482632035365105

%N a(n) = n^n-n^(n-1)-n^(n-2)-...-n^2-n-1.

%H Danny Rorabaugh, <a href="/A191690/b191690.txt">Table of n, a(n) for n = 1..350</a>

%F a(n) = A117667(n)-1. - _Robert G. Wilson v_, Apr 16 2015

%F a(n) = n^n - A023037(n). - _Danny Rorabaugh_, Apr 20 2015

%e 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).

%p A191690 := proc(n) n^n-add( n^j,j=0..n-1) ; end proc: # _R. J. Mathar_, Jun 23 2011

%t Table[Total[-n^Range[0,n-1]]+n^n,{n,2,20}] (* _Harvey P. Dale_, Jul 06 2011 *)

%t f[n_] := ((n - 2) n^n + n)/(n - 1) - 1; f[1] = 0; Array[f, 18] (* _Robert G. Wilson v_, Apr 16 2015 *)

%o (PARI) a(n) = n^n - sum(k=0, n-1, n^k); \\ _Michel Marcus_, Apr 16 2015

%o (Sage) [n^n - sum([n^k for k in range(n)]) for n in range(1,19)] # _Danny Rorabaugh_, Apr 20 2015

%Y Cf. A000312, A023037, A191686.

%K nonn

%O 1,3

%A _Juri-Stepan Gerasimov_, Jun 11 2011

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 24 08:59 EDT 2024. Contains 371935 sequences. (Running on oeis4.)