|
| |
|
|
A080568
|
|
Sum of the Fibonacci numbers A000045 and the factorials A000142.
|
|
1
| |
|
|
1, 2, 3, 8, 27, 125, 728, 5053, 40341, 362914, 3628855, 39916889, 479001744, 6227021033, 87178291577, 1307674368610, 20922789888987, 355687428097597
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| Original puzzle was to find the next four terms after 2, 3, 8, 27, 125. The cubes were intended to mislead - providing one further term would have made the intended sequence too obvious.
|
|
|
REFERENCES
| Cambridge Archimedeans' Problems Drive, 2001.
|
|
|
LINKS
| Vincenzo Librandi, Table of n, a(n) for n = 0..100
|
|
|
MAPLE
| with (combstruct):with (combinat):a:=proc(m) [ZL, {ZL=Set(Cycle(Z, card>=m))}, labeled]; end: ZLL:=a(1):seq(count(ZLL, size=n)+fibonacci(n), n=0..19); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 11 2008
|
|
|
MATHEMATICA
| Table[n!+Fibonacci[n], {n, 0, 100}] (* From Vladimir Joseph Stephan Orlovsky, May 02 2011 *)
|
|
|
PROG
| (MAGMA) [Factorial(n)+Fibonacci(n): n in [0..25]]; // Vincenzo Librandi, May 03 2011
|
|
|
CROSSREFS
| Cf. A000045, A000142.
Sequence in context: A086613 A121401 A093858 * A091339 A006277 A186927
Adjacent sequences: A080565 A080566 A080567 * A080569 A080570 A080571
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Alasdair Kergon (agk(AT)oxlug.org), Feb 21 2003
|
| |
|
|
