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!)
A258387 a(n) = (n+1)^n + n^(n-1). 1

%I #16 Sep 08 2022 08:46:12

%S 3,11,73,689,8401,125425,2214801,45143873,1043046721,26937424601,

%T 768945795289,24041093493169,817012858376625,29986640798644769,

%U 1182114430632237601,49814113380273715457,2234572751614363400449,106313261857649938064809

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

%H Daniel Suteu, <a href="/A258387/b258387.txt">Table of n, a(n) for n = 1..20</a>

%F a(n) = (n+1)^n + n^(n-1).

%e For n=3 the a(3) = 73.

%e (3+1)^3 + 3^(3-1) = 4^3 + 3^2.

%e 4^3 + 3^2 = 64 + 9 = 73.

%t Array[(# + 1)^# + #^(# - 1) &, 20] (* _Vincenzo Librandi_, May 29 2015 *)

%o (Sidef)

%o func a(n) {

%o (n+1)**n + n**(n-1)

%o };

%o 1.to(Math.inf).each { |n|

%o say a(n);

%o };

%o (Magma) [(n+1)^n + n^(n-1): n in [1..20]]; // _Vincenzo Librandi_, May 29 2015

%o (PARI) vector(10,n,(n+1)^n+n^(n-1)) \\ _Derek Orr_, Jun 01 2015

%Y Cf. A178922, A258384.

%K nonn,easy

%O 1,1

%A _Daniel Suteu_, May 28 2015

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 13:30 EDT 2024. Contains 371957 sequences. (Running on oeis4.)