id:A066200 - OEIS Search Results

Search: id:A066200

Displaying 1-1 of 1 results found.

page 1

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

+0
2

1, 5, 10, 4, 11, 3, 12, 2, 13, 25, 38, 24, 9, 25, 8, 26, 7, 27, 6, 28, 51, 75, 50, 76, 49, 21, 50, 20, 51, 19, 52, 18, 53, 17, 54, 16, 55, 15, 56, 14, 57, 101, 146, 100, 147, 99, 148, 98, 47, 99, 46, 100, 45, 101, 44, 102, 43, 103, 42, 104, 41, 105, 40, 106, 39, 107, 176 (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: A102258 A084341 A054513 this_sequence A053822 A137404 A110643` `Adjacent sequences: A066197 A066198 A066199 this_sequence A066201 A066202 A066203`
	KEYWORD	`nonn,easy`
	AUTHOR	`njas, Dec 16 2001`
	EXTENSIONS	`More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Dec 16 2001`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research