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
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
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
Sequence in context: A345030 A127716 A035378 * A350834 A054461 A342433
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 02:23 EDT 2024. Contains 371264 sequences. (Running on oeis4.)