
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, 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, 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
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

The height of a term in A005132 = number of addition steps  number of subtraction steps to produce it.


LINKS

Table of n, a(n) for n=1..99.
Nick Hobson, Python program for this sequence
N. J. A. Sloane, FORTRAN program for A005132, A057167, A064227, A064228
Index entries for sequences related to Recamán's sequence


EXAMPLE

A005132 begins 1, 3, 6, 2, 7, 13, 20, 12, ... and these terms have heights 1, 2, 3, 2, 3, 4, 5, 4, ...


CROSSREFS

Cf. A005132, A064288, A064290, A064292, A064293, A064294.
Sequence in context: A209302 A205122 A174863 * A078759 A276439 A282701
Adjacent sequences: A064286 A064287 A064288 * A064290 A064291 A064292


KEYWORD

nonn


AUTHOR

N. J. A. Sloane, Sep 25 2001


STATUS

approved

