id:A064289 - OEIS Search Results

Search: id:A064289

Displaying 1-1 of 1 results found.

page 1

Height of n-th term in Recaman's sequence A005132.

+0
9

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, 5, 6, 5, 6, 5, 6, 7, 8, 7, 8, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 7, 8, 9, 8, 9, 8, 9, 8, 9, 8, 9, 8, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 7 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`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` `Nick Hobson, Python program for this sequence`
	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, A064288, A064290, A064292, A064293, A064294.` `Adjacent sequences: A064286 A064287 A064288 this_sequence A064290 A064291 A064292` `Sequence in context: A064672 A138554 A063772 this_sequence A078759 A095207 A065362`
	KEYWORD	`nonn`
	AUTHOR	`njas, Sep 25 2001`

page 1

Search completed in 0.002 seconds

Last modified May 12 19:26 EDT 2008. Contains 139661 sequences.

AT&T Labs Research