|
| |
|
|
A064288
|
|
Height of n when it appears for first time in Recamán's sequence A005132.
|
|
9
|
|
|
|
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, 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;
text;
internal format)
|
|
|
|
OFFSET
|
0,3
|
|
|
COMMENTS
|
The height of a term in A005132 = number of addition steps - number of subtraction steps to produce it (see A064289).
|
|
|
LINKS
|
Rémy Sigrist, Table of n, a(n) for n = 0..1354
Rémy Sigrist, C program for A064288
N. J. A. Sloane, FORTRAN program for A005132, A057167, A064227, A064228
Index entries for sequences related to Recamán's sequence
|
|
|
EXAMPLE
|
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, ...
|
|
|
PROG
|
(C) See Links section.
|
|
|
CROSSREFS
|
Cf. A005132, A064289, A064290, A064291, A064292, A064293, A064294.
Sequence in context: A152825 A347073 A261710 * A054085 A021443 A045923
Adjacent sequences: A064285 A064286 A064287 * A064289 A064290 A064291
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
N. J. A. Sloane, Sep 25 2001
|
|
|
EXTENSIONS
|
a(0)=0 added by N. J. A. Sloane, May 01 2020
|
|
|
STATUS
|
approved
|
| |
|
|
