login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066204 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). 1
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; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..67.

Index entries for sequences related to Recamán's sequence

CROSSREFS

A variant of A005132. A row of the array in A066202.

Sequence in context: A200490 A016499 A295677 * A217537 A154278 A220451

Adjacent sequences:  A066201 A066202 A066203 * A066205 A066206 A066207

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, Dec 16 2001

EXTENSIONS

More terms from Vladeta Jovovic, Dec 16 2001

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 16 23:51 EST 2018. Contains 317275 sequences. (Running on oeis4.)