id:A066203 - OEIS Search Results

Search: id:A066203

Displaying 1-1 of 1 results found.

page 1

a(1) = 2; a(2) = 1; for n > 2, 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

2, 1, 3, 6, 10, 5, 11, 4, 12, 21, 31, 20, 8, 21, 7, 22, 38, 55, 37, 18, 38, 17, 39, 16, 40, 15, 41, 14, 42, 13, 43, 74, 106, 73, 107, 72, 36, 73, 35, 74, 34, 75, 33, 76, 32, 77, 123, 170, 122, 171, 121, 70, 122, 69, 123, 68, 124, 67, 9, 68, 128, 189, 127, 64, 128, 63, 129, 62 (list; graph; listen)

	OFFSET	`1,1`
	LINKS	`Index entries for sequences related to Recaman's sequence`
	CROSSREFS	`A variant of A005132. A row of the array in A066202.` `Sequence in context: A057925 A086964 A076242 this_sequence A024866 A076058 A098124` `Adjacent sequences: A066200 A066201 A066202 this_sequence A066204 A066205 A066206`
	KEYWORD	`nonn,easy`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), 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 November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research