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!)
A258388 a(n) = n^(n+1) + (n-1)^n. 1
1, 1, 9, 89, 1105, 16649, 295561, 6044737, 139982529, 3621002129, 103486784401, 3238428376721, 110131633755793, 4044369591078361, 159505471943511513, 6723976451270702849, 301716313535065716481, 14358232357247077816865, 722298429807405401348641 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Daniel Suteu and Alois P. Heinz, Table of n, a(n) for n = 0..350 (first 20 terms from Daniel Suteu)

FORMULA

From Robert Israel, Jun 04 2015: (Start)

a(n) = A007778(n-1) + A007778(n) for n>0.

E.g.f.: 1/(1 + W(-x))^3 - 1/(1 + W(-x))^2 - x/(W(-x)*(1+W(-x))) where W is the Lambert W function. (End)

EXAMPLE

a(3) = 3^(3+1) + (3-1)^3 = 3^4 + 2^3 = 81 + 8 = 89.

MAPLE

a:= n-> n^(n+1)+(n-1)^n:

seq(a(n), n=0..20);  # Alois P. Heinz, Jun 04 2015

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^(n+1)+(n-1)^n: n in [0..20]]; // Vincenzo Librandi, May 29 2015

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

CROSSREFS

Cf. A007778, A084363.

Sequence in context: A101679 A075507 A094935 * A296618 A230114 A187090

Adjacent sequences:  A258385 A258386 A258387 * A258389 A258390 A258391

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 August 3 22:03 EDT 2021. Contains 346441 sequences. (Running on oeis4.)