A078759 Height of n-th term in A064389 (variation (4) of Recamán's sequence).

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, 7, 8, 7, 8, 7, 6, 5, 6, 5, 6, 7, 8, 7, 6, 7, 8, 9, 8, 7, 6, 7, 6, 7, 6, 7, 8, 9, 8, 9, 8, 7, 6, 7, 8, 9, 8, 9, 8, 9, 8, 9, 8, 7, 8, 9, 10, 9, 10, 9, 8, 7, 8, 7, 8, 9, 10, 9, 10, 9, 10, 9, 8, 9, 10, 11, 10, 11, 10, 9, 8, 9, 8, 9, 10

Offset

1,2

Links

Nick Hobson, Table of n, a(n) for n=1..10000

Nick Hobson, Python program for this sequence

Formula

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

Crossrefs

Cf. A005132, A064289, A064389.

Sequence in context: A205122 A174863 A064289 * A276439 A282701 A095207

Adjacent sequences: A078756 A078757 A078758 * A078760 A078761 A078762

Keyword

nonn

Author

Reiner Martin, Jan 08 2003

Status

approved