id:A078759 - OEIS Search Results

Search: id:A078759

Displaying 1-1 of 1 results found.

page 1

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

+0
1

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; listen)

	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: A138554 A063772 A064289 this_sequence A095207 A065362 A083219` `Adjacent sequences: A078756 A078757 A078758 this_sequence A078760 A078761 A078762`
	KEYWORD	`nonn`
	AUTHOR	`Reiner Martin (reinermartin(AT)hotmail.com), Jan 08 2003`

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research