|
Search: id:A002022
|
|
|
| A002022 |
|
Pile of coconuts problem.
(Formerly M4305 N1800)
|
|
+0
3
|
|
| 0, 6, 240, 1020, 78120, 279930, 40353600, 134217720, 31381059600, 99999999990, 34522712143920, 106993205379060, 51185893014090744, 155568095557812210, 98526125335693359360, 295147905179352825840, 239072435685151324847136
(list; graph; listen)
|
|
|
OFFSET
|
2,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
|
|
MAPLE
|
f := proc(n) if n mod 2 = 1 then RETURN((n-1)^n-(n-1)) else RETURN((n-1)^(n+1)-(n-1)) fi; end:
|
|
CROSSREFS
|
Cf. A002021, A006091.
Sequence in context: A099129 A145180 A077231 this_sequence A065948 A052510 A137892
Adjacent sequences: A002019 A002020 A002021 this_sequence A002023 A002024 A002025
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
Formula and more terms from James A. Sellers (sellersj(AT)math.psu.edu), Feb 10 2000
|
|
|
Search completed in 0.002 seconds
|
