Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066068
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066068 n^n + n. +0
2
1, 2, 6, 30, 260, 3130, 46662, 823550, 16777224, 387420498, 10000000010, 285311670622, 8916100448268, 302875106592266, 11112006825558030, 437893890380859390, 18446744073709551632, 827240261886336764194 (list; graph; listen)
OFFSET

0,2

FORMULA

E.g.f.: (1-x*e^x*T(x)+x*e^x)/(1-T(x)), where T(x) is Euler's tree function (see A000169). - Len Smiley (smiley(AT)math.uaa.alaska.edu), Dec 04 2001

Resultant of nx^n+1 and nx-1. - Ralf Stephan, Nov 20 2004

MATHEMATICA

Table[ n^n + n, {n, 1, 18} ]

PROGRAM

(PARI) { for (n=0, 100, a=n^n + n; write("b066068.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Nov 09 2009]

CROSSREFS

Sequence in context: A106209 A003266 A097385 this_sequence A121406 A028361 A106339

Adjacent sequences: A066065 A066066 A066067 this_sequence A066069 A066070 A066071

KEYWORD

easy,nonn,new

AUTHOR

George E. Antoniou (george.antoniou(AT)montclair.edu), Dec 02 2001

EXTENSIONS

More terms from Larry Reeves (larryr(AT)acm.org) and Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 03 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research