|
Search: id:A002021
|
|
|
| A002021 |
|
Pile of coconuts problem: (n-1)(n^n - 1), n even; n^n - n + 1, n odd.
(Formerly M3114 N1262)
|
|
+0
3
|
|
| 1, 3, 25, 765, 3121, 233275, 823537, 117440505, 387420481, 89999999991, 285311670601, 98077104930805, 302875106592241, 144456088732254195
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
Problem 3242, Amer. Math. Monthly, 35 (1928), 47-48.
|
|
LINKS
|
Ben Ames Williams, Coconuts Problem
|
|
CROSSREFS
|
Cf. A002022, A006091.
Sequence in context: A127231 A062411 A136516 this_sequence A012764 A101733 A094815
Adjacent sequences: A002018 A002019 A002020 this_sequence A002022 A002023 A002024
|
|
KEYWORD
|
easy,nonn,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.003 seconds
|
