|
|
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, 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, 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
(list; graph; refs; listen; history; 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
| Index entries for sequences related to Recaman's sequence
N. J. A. Sloane, FORTRAN program for A005132, A057167, A064227, A064228
|
|
|
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, A064289, A064290 - A064294.
Sequence in context: A126851 A142070 A152825 * A054085 A021443 A045923
Adjacent sequences: A064285 A064286 A064287 * A064289 A064290 A064291
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Sep 25 2001
|
|
