id:A066199 - OEIS Search Results

Search: id:A066199

Displaying 1-1 of 1 results found.

page 1

a(1) = 1; for n > 1, a(n) = a(n-1)-(n+1) if this is positive and has not already appeared in the sequence, otherwise a(n) = a(n-1)+(n+1).

+0
2

1, 4, 8, 3, 9, 2, 10, 19, 29, 18, 6, 19, 5, 20, 36, 53, 35, 16, 36, 15, 37, 14, 38, 13, 39, 12, 40, 11, 41, 72, 104, 71, 105, 70, 34, 71, 33, 72, 32, 73, 31, 74, 30, 75, 121, 168, 120, 169, 119, 68, 120, 67, 121, 66, 122, 65, 7, 66, 126, 187, 125, 62, 126, 61, 127, 60, 128 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`Index entries for sequences related to Recaman's sequence`
	CROSSREFS	`A variant of A005132. A row of the array in A066201.` `Sequence in context: A132797 A065191 A021678 this_sequence A103647 A033197 A124002` `Adjacent sequences: A066196 A066197 A066198 this_sequence A066200 A066201 A066202`
	KEYWORD	`nonn,easy`
	AUTHOR	`njas, Dec 16 2001`
	EXTENSIONS	`More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Mar 24 2002`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research