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!)
A066279 a(n) = n^n + n + 1. 4

%I #12 Feb 03 2020 15:31:55

%S -1,2,3,7,31,261,3131,46663,823551,16777225,387420499,10000000011,

%T 285311670623,8916100448269,302875106592267,11112006825558031,

%U 437893890380859391,18446744073709551633,827240261886336764195,39346408075296537575443,1978419655660313589123999

%N a(n) = n^n + n + 1.

%H Harry J. Smith, <a href="/A066279/b066279.txt">Table of n, a(n) for n = -1..100</a>

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

%o (PARI) { for (n=-1, 100, write("b066279.txt", n, " ", n^n + n + 1) ) } \\ _Harry J. Smith_, Feb 08 2010

%Y Cf. A000012, A000312, A001477.

%K sign

%O -1,2

%A _George E. Antoniou_, Dec 10 2001

%E More terms from _Robert G. Wilson v_, Dec 11 2001

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 April 25 11:03 EDT 2024. Contains 371967 sequences. (Running on oeis4.)