|
%I #24 May 10 2020 13:46:47
%S 0,1,2,2,7,7,3,3,4,4,4,4,4,4,5,5,5,5,5,18,5,5,5,5,5,5,6,6,6,6,6,6,6,6,
%T 6,6,6,6,6,6,7,6,6,6,6,6,6,8,8,8,8,8,8,8,8,8,8,8,8,8,8,19,7,7,7,7,7,7,
%U 7,7,7,7,7,7,7,7,19,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,9,9,9,9,9,9,9,9
%N Height of n when it appears for first time in Recamán's sequence A005132.
%C The height of a term in A005132 = number of addition steps - number of subtraction steps to produce it (see A064289).
%H Rémy Sigrist, <a href="/A064288/b064288.txt">Table of n, a(n) for n = 0..1354</a>
%H Rémy Sigrist, <a href="/A064288/a064288.txt">C program for A064288</a>
%H N. J. A. Sloane, <a href="/A005132/a005132.txt">FORTRAN program for A005132, A057167, A064227, A064228</a>
%H <a href="/index/Rea#Recaman">Index entries for sequences related to Recamán's sequence</a>
%e A005132 begins 0, 1, 3, 6, 2, 7, 13, 20, 12, ... and these terms have heights 0, 1, 2, 3, 2, 3, 4, 5, 4, ...
%o (C) See Links section.
%Y Cf. A005132, A064289, A064290, A064291, A064292, A064293, A064294.
%K nonn
%O 0,3
%A _N. J. A. Sloane_, Sep 25 2001
%E a(0)=0 added by _N. J. A. Sloane_, May 01 2020
|
