%I M4328 #14 Sep 19 2017 12:06:52
%S 0,7,5,65,11,63,9,17,61,69,7,15,59,23,67,93,31,13,57,57,21,65,21,91,
%T 29,73,11,55,11,55,19,63,63,19,45,89,27,27,71,27,53,53,9,35,53,79,17,
%U 61,61,61,17,43,61
%N Shortest wins at Beanstalk.
%C a(n) gives the shortest win for the game Beanstalk when starting with 2*n+1. - _Sean A. Irvine_, Aug 06 2016
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Sean A. Irvine, <a href="/A005692/b005692.txt">Table of n, a(n) for n = 0..999</a>
%H R. K. Guy, <a href="http://www.jstor.org/stable/2689400">John Isbell's game of beanstalk and John Conway's game of beans-don't-talk</a>, Math. Mag. 59 (1986), no. 5, 259-269.
%K nonn
%O 0,2
%A _N. J. A. Sloane_.