id:A066204 - OEIS Search Results

Search: id:A066204

Displaying 1-1 of 1 results found.

page 1

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

4, 3, 1, 4, 8, 13, 7, 14, 6, 15, 5, 16, 28, 41, 27, 12, 28, 11, 29, 10, 30, 9, 31, 54, 78, 53, 79, 52, 24, 53, 23, 54, 22, 55, 21, 56, 20, 57, 19, 58, 18, 59, 17, 60, 104, 149, 103, 150, 102, 151, 101, 50, 102, 49, 103, 48, 104, 47, 105, 46, 106, 45, 107, 44, 108, 43, 109 (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: A119505 A130806 A016499 this_sequence A020839 A087274 A103552` `Adjacent sequences: A066201 A066202 A066203 this_sequence A066205 A066206 A066207`
	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