login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A078759 Height of n-th term in A064389 (variation (4) of Recamán's sequence). 2
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 (list; graph; refs; listen; history; text; internal format)
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 (reinermartin(AT)hotmail.com), Jan 08 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 20 14:53 EST 2018. Contains 317402 sequences. (Running on oeis4.)