login
This site is supported by donations to The OEIS Foundation.

 

Logo

Many excellent designs for a new banner were submitted. We will use the best of them in rotation.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A051442 n^(n+1)+(n+1)^n. 11
1, 3, 17, 145, 1649, 23401, 397585, 7861953, 177264449, 4486784401, 125937424601, 3881436747409, 130291290501553, 4731091158953433, 184761021583202849, 7721329860319737601, 343809097055019694337, 16248996011806421522977 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Odd prime p divides a(p-2). For n>1 a(Prime[n]-2)/Prime[n] = A125074(n) = {1, 29, 3343, 407889491, 298572057493, 454195874136455153, ...}. Prime p divides a((p+5)/2) for p = {19, 23, 61}. - Alexander Adamchuk, Nov 18 2006

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..200

FORMULA

a(n) = (n + e + o(1))n^n. [Charles R Greathouse IV, Jan 12 2012]

MATHEMATICA

lst={}; Do[m=n+1; q=n^m+m^n; AppendTo[lst, q], {n, 0, 3*4!}]; lst [From Vladimir Joseph Stephan Orlovsky, Jan 23 2009]

PROG

(PARI) a(n)=(n+1)^n+n^(n+1) \\ Charles R Greathouse IV, Jan 12 2012

(MAGMA)[n^(n+1)+(n+1)^n: n in [0..20]]; // Vincenzo Librandi, Jan 12 2012

(Maxima) A051442[n]:=n^(n+1)+(n+1)^n$ makelist(A051442[n], n, 0, 30); /* Martin Ettl, Oct 29 2012 */

CROSSREFS

Cf. A007925, A051443, A125074.

Sequence in context: A087885 A178685 A198860 * A162650 A015735 A140983

Adjacent sequences:  A051439 A051440 A051441 * A051443 A051444 A051445

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified April 19 00:07 EDT 2014. Contains 240735 sequences.