login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A258387 a(n) = (n+1)^n + n^(n-1). 1
3, 11, 73, 689, 8401, 125425, 2214801, 45143873, 1043046721, 26937424601, 768945795289, 24041093493169, 817012858376625, 29986640798644769, 1182114430632237601, 49814113380273715457, 2234572751614363400449, 106313261857649938064809 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Daniel Suteu, Table of n, a(n) for n = 1..20

FORMULA

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

EXAMPLE

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

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

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

MATHEMATICA

Array[(# + 1)^# + #^(# - 1) &, 20] (* Vincenzo Librandi, May 29 2015 *)

PROG

(Sidef)

func a(n) {

    (n+1)**n + n**(n-1)

};

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

    say a(n);

};

(MAGMA) [(n+1)^n + n^(n-1): n in [1..20]]; // Vincenzo Librandi, May 29 2015

(PARI) vector(10, n, (n+1)^n+n^(n-1)) \\ Derek Orr, Jun 01 2015

CROSSREFS

Cf. A178922, A258384.

Sequence in context: A345030 A127716 A035378 * A054461 A342433 A203772

Adjacent sequences:  A258384 A258385 A258386 * A258388 A258389 A258390

KEYWORD

nonn,easy

AUTHOR

Daniel Suteu, May 28 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 19 00:22 EDT 2021. Contains 347549 sequences. (Running on oeis4.)