id:A118201 - OEIS Search Results

Search: id:A118201

Displaying 1-1 of 1 results found.

page 1

Smallest difference such that both difference and number do not occur previously.

+0
2

0, 1, 3, 6, 2, 7, 13, 20, 12, 21, 11, 22, 10, 23, 9, 24, 8, 25, 43, 62, 42, 63, 41, 18, 44, 68, 93, 66, 38, 67, 37, 5, 36, 69, 35, 70, 34, 71, 33, 72, 32, 73, 31, 74, 30, 75, 29, 76, 28, 77, 27, 78, 26, 79, 133, 188, 132, 189, 131, 190, 130, 191, 129, 192, 128, 193, 127, 60, 134 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`Similar to Recaman's sequence (A005132), but increases the difference to avoid duplicating values. Conjecture that every nonnegative integer occurs in this sequence. Evaluating through n=20000, the smallest number that has not occurred is 139.`
	FORMULA	`a(n+1) = a(n)-d or a(n)+d, where a(n+1) must be positive and must not have occurred previously in the sequence; choose the smallest positive d such that this is possible where d is not \|a(m+1)-a(m)\| for any m < n; if both a(n)-d and a(n)+d have not occurred, choose a(n)-d.`
	CROSSREFS	`Cf. A118202 (inverse), A005132.` `Sequence in context: A064388 A064387 A064389 this_sequence A113880 A098141 A135598` `Adjacent sequences: A118198 A118199 A118200 this_sequence A118202 A118203 A118204`
	KEYWORD	`nonn`
	AUTHOR	`Frank Adams-Watters (FrankTAW(AT)Netscape.net), Apr 14 2006`

page 1

Search completed in 0.002 seconds

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.

AT&T Labs Research