|
| |
|
|
A006091
|
|
n^n - n + 1.
(Formerly M3111)
|
|
4
| |
|
|
1, 3, 25, 253, 3121, 46651, 823537, 16777209, 387420481, 9999999991, 285311670601, 8916100448245, 302875106592241, 11112006825558003, 437893890380859361, 18446744073709551601, 827240261886336764161, 39346408075296537575407, 1978419655660313589123961
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Related to famous "coconuts" problem - cf. A002021, A002022.
Also main diagonal of A193871. - Omar E. Pol, Aug 22 2011
|
|
|
REFERENCES
| Archimedeans Problems Drive, Eureka, 41 (1981), 7.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
| Vincenzo Librandi, Table of n, a(n) for n = 1..200
J. Burkardt, The Coconut puzzle(version 3)
|
|
|
MATHEMATICA
| Table[n^n-n+1, {n, 20}] (* From Harvey P. Dale, June 09 2011 *)
|
|
|
PROG
| (MAGMA) [n^n - n + 1: n in [1..20]]; // Vincenzo Librandi, Aug 23 2011
|
|
|
CROSSREFS
| Cf. A014293.
Sequence in context: A099913 A086655 A064326 * A009042 A080896 A126746
Adjacent sequences: A006088 A006089 A006090 * A006092 A006093 A006094
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
