|
Search: id:A094062
|
|
|
| A094062 |
|
Ceiling((3-sqrt(3))*4^(n-3)) + 1. |
|
+0
2
|
|
| 1, 2, 3, 7, 22, 83, 326, 1300, 5195, 20776, 83098, 332387, 1329543, 5318166, 21272659, 85090631, 340362521, 1361450080, 5445800316, 21783201259, 87132805033, 348531220128, 1394124880509, 5576499522030, 22305998088117
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
From a new version of the camel problem. The original camel problem is discussed by de Bondt. A camel can carry one banana at a time on his back. It is on diet and therefore can only have one banana at a time in its stomach. As soon as it has eaten a banana it walks a mile and then needs a new banana (in order to be able to continue its iterary).
Let there be a stock of N bananas at the border of the desert. How far can the camel penetrate into the desert? (Of course it can form new stocks with transported bananas.)
The new version: Find a(n), the number of bananas needed for the camel to penetrate into the desert at least n miles.
The ceiling-formula of the definition yields A101360, but the solution of the Camel problem at N=1 is a(1)=1 as in this sequence. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 02 2008]
|
|
REFERENCES
|
Michiel de Bondt, The Camel-Banana Problem, Nieuw Archief voor de Wiskunde, 14-4, No. 3, 1996, pp. 415-426.
Matthijs Coster, Camels and Bananas, Preprint, Apr 29, 2004
|
|
LINKS
|
Matthijs Coster, Sequences
|
|
CROSSREFS
|
Adjacent sequences: A094059 A094060 A094061 this_sequence A094063 A094064 A094065
Sequence in context: A053966 A010738 A114599 this_sequence A038159 A077210 A072214
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Matthijs Coster (matthijs(AT)coster.demon.nl), Apr 29 2004
|
|
EXTENSIONS
|
More terms from Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), May 03 2006
|
|
|
Search completed in 0.002 seconds
|
