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!)
A258389 a(n) = (n^(n+1)-(n-1)^n) + ((n+1)^n-n^(n-1)). 2
2, 14, 128, 1504, 21752, 374184, 7464368, 169402496, 4309519952, 121450640200, 3755499322808, 126409853754144, 4600799868451880, 180029930424249416, 7536568838736534752, 336087767194699956736, 15905186914751401828640, 796113699641442496367496 (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^(n+1)-(n-1)^n) + ((n+1)^n-n^(n-1)) = A084363(n) + A178922(n).

a(n) = A051442(n) - A051442(n-1). - Mathew Englander, Jul 08 2020

EXAMPLE

For a(3) = (3^(3+1)-(3-1)^3) + ((3+1)^3-3^(3-1)) = (3^4 - 2^3) + (4^3 - 3^2) = 128.

MATHEMATICA

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

PROG

(Sidef)

func a(n) {

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

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

};

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

    say a(n);

};

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

CROSSREFS

Cf. A051442, A084363, A178922.

Sequence in context: A216595 A155650 A331397 * A168658 A235347 A235352

Adjacent sequences:  A258386 A258387 A258388 * A258390 A258391 A258392

KEYWORD

nonn

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 June 21 19:59 EDT 2021. Contains 345365 sequences. (Running on oeis4.)