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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080030 a(n) is taken to be the smallest positive integer not already present which is consistent with the condition "n is a member of the sequence if and only if a(n) is congruent to 1 mod 3". 4
2, 1, 4, 5, 7, 10, 8, 13, 16, 11, 19, 22, 14, 25, 28, 17, 31, 34, 20, 37, 40, 23, 43, 46, 26, 49, 52, 29, 55, 58, 32, 61, 64, 35, 67, 70, 38, 73, 76, 41, 79, 82, 44, 85, 88, 47, 91, 94, 50, 97, 100, 53, 103, 106, 56, 109, 112, 59, 115, 118, 62, 121, 124, 65, 127, 130, 68 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

A permutation of all positive non-multiples of 3. - Matthew Vandermast, Mar 21 2003

LINKS

Table of n, a(n) for n=0..66.

B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, J. Integer Seqs., Vol. 6 (2003), #03.2.2.

B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence (math.NT/0305308)

FORMULA

a(3m)=3m+2, a(3m+1)=6m+1, a(3m+2)=6m+4.

CROSSREFS

Cf. A079000, A079313, A080029, A080031.

Sequence in context: A021992 A292388 A261035 * A125156 A119808 A021470

Adjacent sequences:  A080027 A080028 A080029 * A080031 A080032 A080033

KEYWORD

easy,nonn

AUTHOR

N. J. A. Sloane, Mar 14 2003

EXTENSIONS

More terms from Matthew Vandermast, Mar 21 2003

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 15 20:47 EST 2019. Contains 319184 sequences. (Running on oeis4.)