Re Recaman

[N. J. A. Sloane]

Jud, yes, right!

The following two sequences make that more precise:


%I A064290
%S A064290 1,3,6,13,20,43,62,113,224,367,494,833,1815,3379,5551,9169,17864,
%T A064290 32978,58964,106218,131313,155719,180118,591890,881467,1345004,
%U A064290 3012446,5728819,9309579,17512700,25641318,52978675,61998980
%N A064290 Smallest number of height n in Recaman's sequence A005132.
%C A064290 The height of a term in A005132 = number of addition steps - number of subtraction steps to produce it.
%H A064290 N. J. A. Sloane, <a href="http://www.research.att.com/~njas/sequences/a005132.txt">Fortran program for A005132, A057167, A064227, A064228</a>
%e A064290 A005132 begins 1, 3, 6, 2, 7, 13, 20, 12, ... and these terms have heights 1, 2, 3, 2, 3, 4, 5, 4, ...
%Y A064290 Cf. A005132, A064288, A064289, A064292, A064293, A064294.
%K A064290 nonn,new
%O A064290 1,2
%A A064290 njas, Sep 25 2001


%I A064292
%S A064292 1,2,3,6,7,18,19,34,67,102,115,190,453,846,1305,2066,4139,7676,
%T A064292 13511,23976,24381,24398,24399,97984,136629,196644,475235,926170,
%U A064292 1466185,2817020,3850823,8348662,8466695,17694894,36130539,36130540
%N A064292 Term at which smallest number of height n occurs in Recaman's sequence A005132.
%C A064292 The height of a term in A005132 = number of addition steps - number of subtraction steps to produce it.
%H A064292 N. J. A. Sloane, <a href="http://www.research.att.com/~njas/sequences/a005132.txt">Fortran program for A005132, A057167, A064227, A064228</a>
%Y A064292 Cf. A005132, A064290, A064293, A064294.
%K A064292 nonn,new
%O A064292 1,2
%A A064292 njas, Sep 26 2001

and


%I A064293
%S A064293 1,2,7,8,14,26,4,47,92,111,181,150,371,361,781,828,366,19,61,879,
%T A064293 4802,3378,5329,9462,32102,18954,18107,16114,4202,25231,60240,92404,
%U A064293 92188,14804
%N A064293 Largest number of height n in Recaman's sequence A005132.
%C A064293 The height of a term in A005132 = number of addition steps - number of subtraction steps to produce it.
%H A064293 N. J. A. Sloane, <a href="http://www.research.att.com/~njas/sequences/a005132.txt">Fortran program for A005132, A057167, A064227, A064228</a>
%Y A064293 Cf. A005132, A064290, A064292, A064294.
%K A064293 nonn,new
%O A064293 1,2
%A A064293 njas, Sep 26 2001


%I A064294
%S A064294 1,4,5,16,31,64,131,222,403,770,1409,2652,4825,9078,16773,30768,
%T A064294 56827,99734,181653,328002,588583,1032996,1787013,3220128,5771203,
%U A064294 10201340,18394609,32144188,58055311,101762018,173367175,302844912
%N A064294 Term at which largest number of height n occurs in Recaman's sequence A005132.
%C A064294 The height of a term in A005132 = number of addition steps - number of subtraction steps to produce it.
%H A064294 N. J. A. Sloane, <a href="http://www.research.att.com/~njas/sequences/a005132.txt">Fortran program for A005132, A057167, A064227, A064228</a>
%Y A064294 Cf. A005132, A064290, A064292, A064293.
%K A064294 nonn,new
%O A064294 1,2
%A A064294 njas, Sep 26 2001

neil