Search: id:A064289 Results 1-1 of 1 results found. %I A064289 %S A064289 1,2,3,2,3,4,5,4,5,4,5,4,5,4,5,4,5,6,7,6,7,6,5,6,5,6,5,6,5,6,5,6,7, %T A064289 8,7,8,7,6,7,6,7,6,7,6,7,6,7,6,7,6,7,6,7,6,7,6,7,6,7,6,7,6,7,6,7,8, %U A064289 9,8,9,8,9,8,9,8,9,8,7,8,7,8,7,8,7,8,7,8,7,8,7,8,7,8,7,8,7,8,7,8,7 %N A064289 Height of n-th term in Recaman's sequence A005132. %C A064289 The height of a term in A005132 = number of addition steps - number of subtraction steps to produce it. %H A064289 Index entries for sequences related to Recaman's sequence %H A064289 N. J. A. Sloane, FORTRAN program for A005132, A057167, A064227, A064228 %H A064289 Nick Hobson, Python program for this sequence %e A064289 A005132 begins 1, 3, 6, 2, 7, 13, 20, 12, ... and these terms have heights 1, 2, 3, 2, 3, 4, 5, 4, ... %Y A064289 Cf. A005132, A064288, A064290, A064292, A064293, A064294. %Y A064289 Sequence in context: A064672 A138554 A063772 this_sequence A078759 A095207 A065362 %Y A064289 Adjacent sequences: A064286 A064287 A064288 this_sequence A064290 A064291 A064292 %K A064289 nonn %O A064289 1,2 %A A064289 N. J. A. Sloane (njas(AT)research.att.com), Sep 25 2001 Search completed in 0.001 seconds